Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matthew Sharp

dblp:50/7822 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorSecurity and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program analysis · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
binary analysis
0.712023
Can a Deep Learning Model for One Architecture Be Used for Others? Retargeted-Architecture Binary Code Analysis · USENIX Security Symposium 2023
Physical-layer communications
cooperative communication
0.112009
Randomized cooperation in asynchronous dispersive links · IEEE Trans. Commun. 2009
Physical-layer communications › beamforming
distributed beamforming
0.112009
Randomized cooperation in asynchronous dispersive links · IEEE Trans. Commun. 2009
Physical-layer communications
diversity
0.012009
Randomized cooperation in asynchronous dispersive links · IEEE Trans. Commun. 2009
Physical-layer communications › channel modeling
frequency-selective channel
0.012009
Randomized cooperation in asynchronous dispersive links · IEEE Trans. Commun. 2009

Methods — techniques the papers use, named apart from their topics

deep learning · 0.7randomized cooperation · 0.1
YearPublicationVenuePosition
2023 Can a Deep Learning Model for One Architecture Be Used for Others? Retargeted-Architecture Binary Code Analysis
Matthew Sharp, Chuxiong Wu, Qiang Zeng 0001, Lannan Luo
USENIX Security Symposium2
2010 On Time Varying Channel Estimation Using Sparse Models
abstract
We consider the design of sufficiently informative inputs for estimating the parameters of a time-varying linear system. Specifically, we assume the output of the system may be modeled as linear combinations of known time-varying elements whose parameters are points in an appropriately chosen grid for the parameter space, such that these parameters are sparse in comparison with the grid size. The sufficiently informative inputs we study are signals that guarantee a unique sparsest solution thereby satisfying minimum requirements for numerically solving the estimation problem. Since in practice the parameters of interest may not lie on the grid constructed for the parameter space, we discuss how our input designs can be modified to provide robustness in the presence of modeling error and noise.
Matthew Sharp, Anna Scaglione
ICC1
2009 Randomized cooperation in asynchronous dispersive links
abstract
Recently, we proposed a decentralized cooperative communication scheme [1]. In this paper we show that randomized decentralized schemes perform well even when the cooperating nodes are asynchronous. In particular we study the attainable diversity for frequency selective channels, and the coding gain in comparison to a centralized scheme.
Matthew Sharp, Anna Scaglione, Birsen Sirkeci-Mergen
IEEE Trans. Commun.1
2008 Application of sparse signal recovery to pilot-assisted channel estimation
abstract
We examine the application of current research in sparse signal recovery to the problem of channel estimation. Specifically, using an orthogonal frequency division multiplexed (OFDM) transmission scheme with pilot symbol assisted modulation (PSAM), we consider the problem of identifying a frequency selective channel from a limited number Q out of a possible M tones of an OFDM symbol. The main observation is that if M is chosen as prime, one can identify the channel uniquely if Q ges 2T, where T is the number of nonzero taps in the frequency-selective channel. The identifiability result requires the minimization of the lo norm, leading to an intractable combinatorial search problem. Several methods have been proposed to deal with these issues, and the one we examine involves l1norm regularization known as basis pursuit, We apply these methods specifically to the problem of estimating a frequency selective channel with PSAM. As a result, the bandwidth efficiency of the system is increased due to the sparsity of the channel.
Matthew Sharp, Anna Scaglione
ICASSP1