2957 search results - page 337 / 592 » The Complexity of Polynomial-Time Approximation |
178
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
210
click to vote
TMC
2012
13 years 9 months ago
2012
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
189
click to vote
SISAP
2009
IEEE
16 years 1 months ago
2009
IEEE
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
167
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
150
click to vote
GLOBECOM
2007
IEEE
16 years 28 days ago
2007
IEEE
— The least-mean square (LMS) decision-feedback equalizer (DFE) was previously shown [1], [2] to possess an extended convergence time in an interference limited environment. In [...