4894 search results - page 612 / 979 » The Guarding Problem - Complexity and Approximation |
243
Voted
ICDAR
2011
IEEE
14 years 7 months ago
2011
IEEE
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
221
click to vote
ICDE
2012
IEEE
13 years 10 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
296
click to vote
PAMI
2012
13 years 10 months ago
2012
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
259
Voted
STOC
2012
ACM
13 years 10 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...
242
click to vote
SDM
2012
SIAM
13 years 10 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...