Sciweavers

794 search results - page 55 / 159
» Improved algorithms for orienteering and related problems
Sort
View
APPROX
2009
Springer
131views Algorithms» more  APPROX 2009»
14 years 3 months ago
An Approximation Scheme for Terrain Guarding
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R....
ICCV
2003
IEEE
14 years 11 months ago
A Sparse Probabilistic Learning Algorithm for Real-Time Tracking
This paper addresses the problem of applying powerful pattern recognition algorithms based on kernels to efficient visual tracking. Recently Avidan [1] has shown that object recog...
Oliver M. C. Williams, Andrew Blake, Roberto Cipol...
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
14 years 3 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
AI
2005
Springer
13 years 9 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
CVPR
2010
IEEE
13 years 9 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...