Sciweavers

5096 search results - page 316 / 1020
» Landscape of Clustering Algorithms
Sort
View
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
16 years 1 days ago
Approximation Schemes for Broadcasting in Heterogenous Networks
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
ICIP
2003
IEEE
15 years 12 months ago
Automatically organizing digital photographs using time and content
We present similarity-based methods to cluster digital photos by time and image content. This approach is general, unsupervised, and makes minimal assumptions regarding the struct...
Matthew L. Cooper, Jonathan Foote, Andreas Girgens...
ICIP
2006
IEEE
16 years 8 months ago
Texture Classification with Ants
In this paper, we present a novel texture classification algorithm inspired by the self-assembling behavior of real ants when building live structures with their bodies. The propo...
Arshad Hussain, Nasir Rajpoot, Kashif Rajpoot
COMPGEOM
2006
ACM
16 years 18 days ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
COMAD
2009
15 years 7 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan