6110 search results - page 160 / 1222 » Approximate Computing |
195
click to vote
CISS
2008
IEEE
16 years 28 days ago
2008
IEEE
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
162
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
183
click to vote
CIVR
2009
Springer
16 years 1 months ago
2009
Springer
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
152
click to vote
PODC
2006
ACM
16 years 12 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
158
click to vote
STOC
1991
ACM
15 years 10 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...