17688 search results - page 480 / 3538 » Data Set Balancing |
200
Voted
SIAMCOMP
1998
15 years 6 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
175
Voted
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
289
Voted
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
197
click to vote
VLDB
2007
ACM
16 years 29 days ago
2007
ACM
There is a growing consensus that it is desirable to query over the structure implicit in unstructured documents, and that ideally this capability should be provided incrementally...
191
Voted
ISMIR
2004
Springer
16 years 7 days ago
2004
Springer
One of the challenges of music information retrieval is the automatic extraction of effective content descriptors of music documents, which can be used at indexing and at retrieva...