Sciweavers

1626 search results - page 232 / 326
» Hybrid computing algorithm in representing solid model
Sort
View
CVPR
2008
IEEE
16 years 5 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
15 years 9 months ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
15 years 6 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
CP
2003
Springer
15 years 8 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
130
Voted
ICCV
2009
IEEE
15 years 29 days ago
Non-iterative approach for fast and accurate vanishing point detection
We present an algorithm that quickly and accurately estimates vanishing points in images of man-made environments. Contrary to previously proposed solutions, ours is neither itera...
Jean-Philippe Tardif