Sciweavers

1171 search results - page 147 / 235
» Variable neighborhood search
Sort
View
ICTAI
2009
IEEE
13 years 7 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
PAMI
2011
13 years 4 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
ECCV
2006
Springer
14 years 12 months ago
The Alignment Between 3-D Data and Articulated Shapes with Bending Surfaces
In this paper we address the problem of aligning 3-D data with articulated shapes. This problem resides at the core of many motion tracking methods with applications in human motio...
Guillaume Dewaele, Frederic Devernay, Radu Horaud,...
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 10 months ago
Modeling relationships at multiple scales to improve accuracy of large recommender systems
The collaborative filtering approach to recommender systems predicts user preferences for products or services by learning past useritem relationships. In this work, we propose no...
Robert M. Bell, Yehuda Koren, Chris Volinsky
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 10 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith