1313 search results - page 172 / 263 » Data Discretization Unification |
131
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
149
click to vote
SIGMOD
2001
ACM
16 years 2 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....
161
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
125
Voted
COMPGEOM
1994
ACM
15 years 6 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
117
Voted
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...