Sciweavers

10608 search results - page 1909 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CVPR
2011
IEEE
13 years 6 months ago
A Global Sampling Method for Alpha Matting
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
Kaiming He, Christoph Rhemann, Carsten Rother, Xia...
CVPR
2011
IEEE
13 years 6 months ago
Learning Temporally Consistent Rigidities
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
Jean-Sebastien Franco, Edmond Boyer
AI
2011
Springer
13 years 5 months ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter
ADC
2010
Springer
204views Database» more  ADC 2010»
13 years 5 months ago
Systematic clustering method for l-diversity model
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...
Md. Enamul Kabir, Hua Wang, Elisa Bertino, Yunxian...
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 5 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
« Prev « First page 1909 / 2122 Last » Next »