2434 search results - page 329 / 487 » Algorithmic Randomness of Closed Sets |
148
click to vote
TPDS
2002
15 years 4 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
134
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we propose an algorithm that recovers binocular disparities in accordance with the surface properties of the scene under consideration. To do so, we estimate the di...
138
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
142
click to vote
DAM
2010
15 years 4 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
144
click to vote
ADAEUROPE
2003
Springer
15 years 10 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...