Sciweavers

847 search results - page 31 / 170
» Approximation algorithms for projective clustering
Sort
View
IJCNN
2008
IEEE
15 years 5 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer
WILF
2009
Springer
791views Fuzzy Logic» more  WILF 2009»
15 years 10 months ago
Fuzzy C-Means Inspired Free Form Deformation Technique for Registration
This paper presents a novel method aimed to free form deformation function approximation for purpose of image registration. The method is currently feature-based. The algorithm i...
Edoardo Ardizzone, Orazio Gambino, Roberto Gallea,...
GLOBECOM
2006
IEEE
15 years 5 months ago
Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
Adel M. Youssef, Mohamed F. Younis, Moustafa Youss...
ICDM
2009
IEEE
175views Data Mining» more  ICDM 2009»
14 years 8 months ago
Maximum Margin Clustering with Multivariate Loss Function
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
Bin Zhao, James Tin-Yau Kwok, Changshui Zhang
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
15 years 11 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett