Sciweavers

2260 search results - page 59 / 452
» A new algorithm for clustering search results
Sort
View
IMCSIT
2010
13 years 5 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica
CIKM
2005
Springer
14 years 1 months ago
Minimal document set retrieval
This paper presents a novel formulation and approach to the minimal document set retrieval problem. Minimal Document Set Retrieval (MDSR) is a promising information retrieval task...
Wei Dai, Rohini K. Srihari
MCS
2001
Springer
14 years 4 days ago
Finding Consistent Clusters in Data Partitions
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
Ana L. N. Fred
CVPR
2006
IEEE
14 years 9 months ago
The Bottleneck Geodesic: Computing Pixel Affinity
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...
Ido Omer, Michael Werman
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 7 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...