2168 search results - page 232 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
247
click to vote
EMMCVPR
2011
Springer
14 years 4 months ago
2011
Springer
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
196
Voted
STOC
2012
ACM
13 years 7 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
100
click to vote
VLSID
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose a method to minimize power dissipation in current-mode CMOS analog and multiple-valued logic (MVL) circuits employing a stack of current comparators. First, we present ...
122
Voted
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...
159
click to vote
TEX
2004
Springer
15 years 10 months ago
2004
Springer
This paper summarizes experiences in converting METAFONT fonts to PostScript fonts with TEXtrace and mftrace, based on programs of autotracing bitmaps (AutoTrace and potrace), and...