Sciweavers

3019 search results - page 154 / 604
» Approximating the Domatic Number
Sort
View
JCDL
2011
ACM
225views Education» more  JCDL 2011»
14 years 9 months ago
How much of the web is archived?
The Memento Project’s archive access additions to HTTP have enabled development of new web archive access user interfaces. After experiencing this web time travel, the inevitabl...
Scott Ainsworth, Ahmed Alsum, Hany SalahEldeen, Mi...
IJCV
2012
13 years 8 months ago
Minimizing Energies with Hierarchical Costs
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...
IJCV
2012
13 years 8 months ago
Sparse Occlusion Detection with Optical Flow
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
Alper Ayvaci, Michalis Raptis, Stefano Soatto
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 6 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
ICRA
2006
IEEE
115views Robotics» more  ICRA 2006»
16 years 11 days ago
Path Planning above a Polyhedral Terrain
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
Hamid Zarrabi-Zadeh