1100 search results - page 77 / 220 » Approximate distance oracles |
COMPGEOM
2005
ACM
14 years 12 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
ANOR
2006
14 years 10 months ago
2006
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
108
click to vote
PAMI
2011
14 years 5 months ago
2011
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
106
click to vote
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....