2600 search results - page 211 / 520 » Clustering with or without the Approximation |
154
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
166
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
133
click to vote
IPPS
2007
IEEE
16 years 27 days ago
2007
IEEE
The advent of the Beowulf cluster in 1994 provided dedicated compute cycles, i.e., supercomputing for the masses, as a cost-effective alternative to large supercomputers, i.e., su...
181
click to vote
ICRA
2005
IEEE
16 years 5 days ago
2005
IEEE
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
170
click to vote
JUCS
2002
15 years 6 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...