Sciweavers

5595 search results - page 60 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
IPPS
2005
IEEE
15 years 10 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
153
Voted
TCS
2010
15 years 2 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
172
Voted
JMLR
2010
198views more  JMLR 2010»
15 years 3 months ago
On Learning with Integral Operators
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...
Lorenzo Rosasco, Mikhail Belkin, Ernesto De Vito
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 5 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
SMI
2008
IEEE
108views Image Analysis» more  SMI 2008»
15 years 11 months ago
Variational Multilevel Mesh Clustering
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and va...
Iurie Chiosa, Andreas Kolb