Sciweavers

2219 search results - page 27 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
CVPR
2004
IEEE
14 years 11 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
GPCE
2004
Springer
14 years 2 months ago
Compiling Process Graphs into Executable Code
Abstract. Model-driven architecture envisions a paradigm shift as dramatic as the one from low-level assembler languages to high-level programming languages. In order for this visi...
Rainer Hauser, Jana Koehler
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 26 days ago
Combining bond-graphs with genetic programming for unified/automated design of mechatronic or multi domain dynamic systems
The multi domain nature of a mechatronic system makes it difficult to model using a single modeling technique over the whole system as varying sets of system variables are require...
Saheeb Ahmed Kayani, Muhammad Afzaal Malik
ACSC
2003
IEEE
14 years 2 months ago
A Novel Approach to Parenting in Functional Program Evaluation
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
Julian R. Dermoudy
COCOON
2007
Springer
14 years 28 days ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh