3341 search results - page 293 / 669 » On Bounded Queries and Approximation |
229
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
171
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
244
click to vote
SSD
2007
Springer
16 years 25 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
224
click to vote
JUCS
2010
15 years 1 months ago
2010
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
159
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
Pseudo relevance feedback (PRF), which has been widely applied in IR, aims to derive a distribution from the top n pseudo relevant documents D. However, these documents are often ...