Sciweavers

2219 search results - page 137 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
114
Voted
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 3 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White
IFIP
1994
Springer
15 years 6 months ago
Program Speedups in Theory and Practice
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
Neil D. Jones
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 7 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
152
Voted
CVPR
2005
IEEE
16 years 4 months ago
A Dynamic Conditional Random Field Model for Object Segmentation in Image Sequences
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
Qiang Ji, Yang Wang 0002
120
Voted
ICCV
2009
IEEE
16 years 7 months ago
Estimating Contact Dynamics
Motion and interaction with the environment are fundamentally intertwined. Few people-tracking algorithms exploit such interactions, and those that do assume that surface geomet...
Marcus A. Brubaker Leonid Sigal David J. Fleet