Sciweavers

126 search results - page 9 / 26
» A Framework for Efficient Minimum Distance Computations
Sort
View
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
14 years 9 months ago
Indexing multi-dimensional time-series with support for multiple distance measures
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...
Michail Vlachos, Marios Hadjieleftheriou, Dimitrio...
ICALP
2007
Springer
14 years 2 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
EOR
2010
178views more  EOR 2010»
13 years 8 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
ECIR
2008
Springer
13 years 10 months ago
Efficient Multimedia Time Series Data Retrieval Under Uniform Scaling and Normalisation
As the world has shifted towards manipulation of information and its technology, we have been increasingly overwhelmed by the amount of available multimedia data while having highe...
Waiyawuth Euachongprasit, Chotirat Ann Ratanamahat...
BTW
2005
Springer
80views Database» more  BTW 2005»
14 years 2 months ago
Measuring the Quality of Approximated Clusterings
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...
Hans-Peter Kriegel, Martin Pfeifle