2600 search results - page 102 / 520 » Clustering with or without the Approximation |
135
click to vote
IDEAS
2006
IEEE
15 years 7 months ago
2006
IEEE
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
141
click to vote
ISNN
2004
Springer
15 years 7 months ago
2004
Springer
This paper proposes a novel hierarchical clustering method that can classify given data without specified knowledge of the number of classes. In this method, at each node of a hie...
107
click to vote
RT
2000
Springer
15 years 5 months ago
2000
Springer
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
105
click to vote
IPMU
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
CAD
2004
Springer
15 years 1 months ago
2004
Springer
Given a nonsingular compact two-manifold F without boundary, we present methods for establishing a family of surfaces which can approximate F so that each approximant is ambient i...