804 search results - page 106 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
COMPGEOM
2010
ACM
14 years 26 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
DIS
1998
Springer
14 years 7 hour ago
1998
Springer
SDS2 is a system to discover and identify the quantitative model consisting of simultaneous equations re
ecting the rst principles underlying the objective process through experi...
ISM
2006
IEEE
13 years 7 months ago
2006
IEEE
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...