Sciweavers

5595 search results - page 219 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CAINE
2003
15 years 7 months ago
A Genetic Algorithm for Clustering on Very Large Data Sets
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
Jim Gasvoda, Qin Ding
WACV
2005
IEEE
15 years 12 months ago
Ensemble Methods in the Clustering of String Patterns
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
André Lourenço, Ana L. N. Fred
155
Voted
IQIS
2005
ACM
15 years 12 months ago
Effective and scalable solutions for mixed and split citation problems in digital libraries
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...
Dongwon Lee, Byung-Won On, Jaewoo Kang, Sanghyun P...
170
Voted
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 6 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
CLUSTER
2000
IEEE
15 years 10 months ago
Contention-free Complete Exchange Algorithm on Clusters
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...
Anthony T. C. Tam, Cho-Li Wang