Sciweavers

2219 search results - page 90 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
115
Voted
IFIP
2004
Springer
15 years 7 months ago
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
Roman Dementiev, Peter Sanders, Dominik Schultes, ...
141
Voted
ECCV
2006
Springer
16 years 4 months ago
Accelerated Convergence Using Dynamic Mean Shift
Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this pa...
Kai Zhang, James T. Kwok, Ming Tang
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 7 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
WEBI
2004
Springer
15 years 7 months ago
Using Semantic Graphs in Clustering Process : Enhance Information Level
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
Jean-Sébastien Brunner, Isabelle Berrien
ICCV
2007
IEEE
16 years 4 months ago
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...
Ali Kemal Sinop, Leo Grady