37 search results - page 3 / 8 » soda 2000 |
SODA
2000
ACM
15 years 5 months ago
2000
ACM
110
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We consider the following two instances of the projective clustering problem: Given a set
SODA
2000
ACM
15 years 5 months ago
2000
ACM
103
Voted
KES
2000
Springer
15 years 7 months ago
2000
Springer
121
Voted
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...