5210 search results - page 189 / 1042 » Exact geometric computation |
154
click to vote
GC
2006
Springer
15 years 6 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
178
click to vote
JMLR
2010
15 years 25 days ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
171
click to vote
RSFDGRC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
241
click to vote
NETWORKS
2011
15 years 29 days ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
189
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we demonstrate how Interval Analysis and Constraint Logic Programming can be used to obtain an accurate geometric model of a scene that rigorously takes into account...