2600 search results - page 72 / 520 » Clustering with or without the Approximation |
TCS
2008
14 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
WSCG
2001
14 years 11 months ago
2001
This paper demonstrates that techniques in flexible body dynamics can yield surprising results when applied to rigid bodies. The discussion presents a technique for constructing r...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Convenient reconstruction of natural plants is a difficult task because of their intrinsic complex geometry. In this paper, we propose a convenient image-based approach to modeli...
IUI
2003
ACM
15 years 3 months ago
2003
ACM
This paper describes an approach to digesting threads of archived discussion lists by clustering messages into approximate topical groups, and then extracting shorter overviews, a...