Sciweavers

24 search results - page 4 / 5
» Polynomials with small Mahler measure
Sort
View
NIPS
2007
14 years 8 days ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...
BMCBI
2006
148views more  BMCBI 2006»
13 years 11 months ago
Exploiting the full power of temporal gene expression profiling through a new statistical test: Application to the analysis of m
Background: The identification of biologically interesting genes in a temporal expression profiling dataset is challenging and complicated by high levels of experimental noise. Mo...
Veronica Vinciotti, Xiaohui Liu, Rolf Turk, Emile ...
JC
2008
128views more  JC 2008»
13 years 10 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 8 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 11 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani