Sciweavers

354 search results - page 17 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
FTTCS
2006
106views more  FTTCS 2006»
14 years 11 months ago
Algorithmic Results in List Decoding
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redunda...
Venkatesan Guruswami
VIS
2004
IEEE
214views Visualization» more  VIS 2004»
16 years 28 days ago
Surface Reconstruction of Noisy and Defective Data Sets
We present a novel surface reconstruction algorithm that can recover high-quality surfaces from noisy and defective data sets without any normal or orientation information. A set ...
Hui Xie, Kevin T. McDonnell, Hong Qin
NIPS
2007
15 years 1 months ago
Cluster Stability for Finite Samples
Over the past few years, the notion of stability in data clustering has received growing attention as a cluster validation criterion in a sample-based framework. However, recent w...
Ohad Shamir, Naftali Tishby
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 3 months ago
Rank Aggregation via Nuclear Norm Minimization
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
David F. Gleich, Lek-Heng Lim
PERCOM
2008
ACM
15 years 11 months ago
Budget-Based Clustering with Context-awareness for Sensor Networks
As the scale of modern sensor networks continues to grow, energy consumption, scalability and routing efficiency are becoming key design challenges. Network management plays an im...
Jiaxi You, Dominik Lieckfeldt, Matthias Handy, Dir...