Sciweavers

2219 search results - page 276 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
AAMAS
2005
Springer
15 years 3 months ago
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
Marcela Capobianco, Carlos Iván Chesñ...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 9 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
CC
2009
Springer
15 years 7 months ago
Scheduling Tasks to Maximize Usage of Aggregate Variables in Place
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
Samah Abu-Mahmeed, Cheryl McCosh, Zoran Budimlic, ...
ICPR
2008
IEEE
16 years 4 months ago
Training sequential on-line boosting classifier for visual tracking
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
Helmut Grabner, Horst Bischof, Jan Sochman, Jiri M...
ICPR
2006
IEEE
16 years 4 months ago
Character Segmentation-by-Recognition Using Log-Gabor Filters
Natural scene images coming usually from lowresolution sensors in embedded context suffer from low text recognition results. Due to several types of degradations, existing algorit...
Bernard Gosselin, Céline Mancas-Thillou