Sciweavers

1299 search results - page 25 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
ECCV
2010
Springer
15 years 3 months ago
Enhancing Interactive Image Segmentation with Automatic Label Set Augmentation
Abstract. We address the problem of having insufficient labels in an interactive image segmentation framework, for which most current methods would fail without further user inter...
CVPR
2007
IEEE
15 years 11 months ago
A Quasi-Minimal Model for Paper-Like Surfaces
Smoothly bent paper-like surfaces are developable. They are however difficult to minimally parameterize since the number of meaningful parameters is intrinsically dependent on the...
Mathieu Perriollat, Adrien Bartoli
CVPR
2010
IEEE
15 years 5 months ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
ICPADS
1998
IEEE
15 years 1 months ago
Fast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
Ting-Lu Huang
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
15 years 1 months ago
Minimizing Stall Time in Single and Parallel Disk Systems
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
Susanne Albers, Naveen Garg, Stefano Leonardi