Sciweavers

2403 search results - page 223 / 481
» Optimal Randomized RANSAC
Sort
View
153
Voted
CVPR
2008
IEEE
16 years 5 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
138
Voted
ICCV
2001
IEEE
16 years 5 months ago
Markov Face Models
The spatial distribution of gray level intensities in an image can be naturally modeled using Markov Random Field (MRF) models. We develop and investigate the performance of face ...
Sarat C. Dass, Anil K. Jain
144
Voted
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 4 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
192
Voted
VLDB
2005
ACM
132views Database» more  VLDB 2005»
16 years 3 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
106
Voted
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
15 years 10 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara