Sciweavers

1814 search results - page 284 / 363
» Watermarking relational data: framework, algorithms and anal...
Sort
View
EMMCVPR
1997
Springer
15 years 3 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
CVPR
1997
IEEE
15 years 2 months ago
Empirical Bayesian EM-based Motion Segmentation
A recent trend in motion-based segmentation has been to rely on statistical procedures derived from ExpectationMaximization (EM) principles. EM-based approaches have various attra...
Nuno Vasconcelos, Andrew Lippman
NIPS
2007
15 years 18 days ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
15 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
SADM
2008
178views more  SADM 2008»
14 years 10 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon