Sciweavers

5595 search results - page 855 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 6 months ago
Settling the Polynomial Learnability of Mixtures of Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We give an algorithm for this problem that has running ...
Ankur Moitra, Gregory Valiant
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 11 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SIAMIS
2011
15 years 1 months ago
Large Scale Bayesian Inference and Experimental Design for Sparse Linear Models
Abstract. Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or superresolution, can be addressed by maxi...
Matthias W. Seeger, Hannes Nickisch
ICML
2009
IEEE
16 years 7 months ago
Archipelago: nonparametric Bayesian semi-supervised learning
Semi-supervised learning (SSL), is classification where additional unlabeled data can be used to improve accuracy. Generative approaches are appealing in this situation, as a mode...
Ryan Prescott Adams, Zoubin Ghahramani
ICML
2001
IEEE
16 years 7 months ago
Bayesian approaches to failure prediction for disk drives
Hard disk drive failures are rare but are often costly. The ability to predict failures is important to consumers, drive manufacturers, and computer system manufacturers alike. In...
Greg Hamerly, Charles Elkan