Sciweavers

911 search results - page 22 / 183
» On the Distance of Databases
Sort
View
DEBU
2010
170views more  DEBU 2010»
13 years 7 months ago
Roads Belong in Databases
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
Jagan Sankaranarayanan, Hanan Samet
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
SSD
2005
Springer
98views Database» more  SSD 2005»
14 years 29 days ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 8 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
ICDE
2007
IEEE
136views Database» more  ICDE 2007»
14 years 8 months ago
Norm, Point, and Distance Estimation Over Multiple Signals Using Max-Stable Distributions
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...
Stilian Stoev, Marios Hadjieleftheriou, George Kol...