Sciweavers

354 search results - page 51 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 3 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
CORR
2012
Springer
198views Education» more  CORR 2012»
13 years 11 months ago
Lipschitz Parametrization of Probabilistic Graphical Models
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the ￿p-norm of the parameters. We discuss several implications ...
Jean Honorio
CIDR
2011
252views Algorithms» more  CIDR 2011»
14 years 6 months ago
Hyder - A Transactional Record Manager for Shared Flash
Hyder supports reads and writes on indexed records within classical multi-step transactions. It is designed to run on a cluster of servers that have shared access to a large pool ...
Philip A. Bernstein, Colin W. Reid, Sudipto Das
AUSDM
2007
Springer
173views Data Mining» more  AUSDM 2007»
15 years 9 months ago
The Use of Various Data Mining and Feature Selection Methods in the Analysis of a Population Survey Dataset
This paper reports the results of feature reduction in the analysis of a population based dataset for which there were no specific target variables. All attributes were assessed a...
Ellen Pitt, Richi Nayak
ICIP
2005
IEEE
16 years 4 months ago
Predictive compression of dynamic 3D meshes
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a sequence of meshes contains a large degree of temporal statistical dependencies tha...
Aljoscha Smolic, Karsten Müller, Matthias Kau...