Sciweavers

338 search results - page 30 / 68
» Effective Lower Bounding Techniques for Pseudo-Boolean Optim...
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Image Segmentation by Branch-and-Mincut
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
Victor S. Lempitsky, Andrew Blake, Carsten Rother
ICCV
2009
IEEE
15 years 28 days ago
Globally Optimal Affine Epipolar Geometry from Apparent Contours
We study the problem of estimating the epipolar geometry from apparent contours of smooth curved surfaces with affine camera models. Since apparent contours are viewpoint depend...
Gang Li, Yanghai Tsin
EUROPAR
2004
Springer
14 years 1 months ago
Improving Data Cache Performance via Address Correlation: An Upper Bound Study
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
Peng-fei Chuang, Resit Sendag, David J. Lilja
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
14 years 1 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
ICCV
2005
IEEE
14 years 10 months ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion