32545 search results - page 91 / 6509 » Data Structures and Algorithms |
135
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
135
click to vote
PAMI
2008
15 years 2 months ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
121
Voted
JODS
2007
15 years 2 months ago
2007
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
175
Voted
ESA
2011
Springer
14 years 2 months ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
127
click to vote
VLDB
1990
ACM
15 years 6 months ago
1990
ACM
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...