Sciweavers

71 search results - page 11 / 15
» Optimal Distance Bounds on Time-Series Data.
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
14 years 11 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
SIGMOD
2011
ACM
203views Database» more  SIGMOD 2011»
14 years 19 days ago
Effective data co-reduction for multimedia similarity search
Multimedia similarity search has been playing a critical role in many novel applications. Typically, multimedia objects are described by high-dimensional feature vectors (or point...
Zi Huang, Heng Tao Shen, Jiajun Liu, Xiaofang Zhou
PODS
2004
ACM
207views Database» more  PODS 2004»
15 years 10 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
15 years 10 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
TOG
2008
70views more  TOG 2008»
14 years 9 months ago
Space-time surface reconstruction using incompressible flow
We introduce a volumetric space-time technique for the reconstruction of moving and deforming objects from point data. The output of our method is a four-dimensional space-time so...
Andrei Sharf, Dan A. Alcantara, Thomas Lewiner, Ch...