Sciweavers

5595 search results - page 414 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Abrupt motion tracking via adaptive stochastic approximation Monte Carlo sampling
Robust tracking of abrupt motion is a challenging task in computer vision due to the large motion uncertainty. In this paper, we propose a stochastic approximation Monte Carlo (...
Xiuzhuang Zhou and Yao Lu
JAIR
2008
126views more  JAIR 2008»
15 years 6 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...
ICIP
2007
IEEE
16 years 8 months ago
Statistically Driven Sparse Image Approximation
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
Rosa M. Figueras i Ventura, Eero P. Simoncelli
GEOINFO
2007
15 years 8 months ago
Approximate String Matching for Geographic Names and Personal Names
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
Clodoveu A. Davis, Emerson de Salles
129
Voted
IPCCC
2006
IEEE
16 years 26 days ago
Cluster based approaches for end-to-end complete feedback collection in multicast
In this paper we study the end-to-end complete feedback collection (ECFC) problem in large scale multicast applications. We consider the case where each receiver is expected to se...
Mehmet Baysan, Kamil Saraç