Sciweavers

136 search results - page 4 / 28
» Experimental Study of Minimum Cut Algorithms
Sort
View
ICCV
1999
IEEE
15 years 11 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ECCV
2002
Springer
15 years 11 months ago
Multi-camera Scene Reconstruction via Graph Cuts
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
Vladimir Kolmogorov, Ramin Zabih
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
14 years 7 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
MP
2006
88views more  MP 2006»
14 years 9 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
JIPS
2008
116views more  JIPS 2008»
14 years 9 months ago
An Empirical Study of Qualities of Association Rules from a Statistical View Point
: Minimum support and confidence have been used as criteria for generating association rules in all association rule mining algorithms. These criteria have their natural appeals, s...
Maryann Dorn, Wen-Chi Hou, Dunren Che, Zhewei Jian...