4843 search results - page 758 / 969 » The Shortcut Problem - Complexity and Approximation |
155
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
233
Voted
FCCM
2011
IEEE
14 years 7 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
82
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
140
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...
129
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
A weighted sum-rate maximization problem is considered for an access point (AP) allocating resources to wireless cognitive radios (CRs) communicating using orthogonal frequency-di...