Sciweavers

3341 search results - page 20 / 669
» On Bounded Queries and Approximation
Sort
View
ACSC
2006
IEEE
14 years 2 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
PODS
2000
ACM
146views Database» more  PODS 2000»
14 years 25 days ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
ICDE
2006
IEEE
266views Database» more  ICDE 2006»
14 years 9 months ago
Approximation Techniques for Indexing the Earth Mover's Distance in Multimedia Databases
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...
Ira Assent, Andrea Wenning, Thomas Seidl
NIPS
2004
13 years 9 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Distance Labeling in Hyperbolic Graphs
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
Cyril Gavoille, Olivier Ly