Sciweavers

3341 search results - page 174 / 669
» On Bounded Queries and Approximation
Sort
View
ICASSP
2010
IEEE
14 years 10 months ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot
90
Voted
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 3 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
INFOVIS
2002
IEEE
15 years 3 months ago
Visualizing Data with Bounded Uncertainty
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
Chris Olston, Jock D. Mackinlay
SAC
2008
ACM
14 years 9 months ago
Extending peer-to-peer networks for approximate search
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
Alain Mowat, Roman Schmidt, Michael Schumacher, Io...
193
Voted
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
15 years 11 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu