Sciweavers

391 search results - page 51 / 79
» Comparison-Based Algorithms Are Robust and Randomized Algori...
Sort
View
HT
2010
ACM
13 years 9 months ago
Analysis of graphs for digital preservation suitability
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
Charles L. Cartledge, Michael L. Nelson
SPAA
2010
ACM
14 years 11 days ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
ICIP
2005
IEEE
14 years 9 months ago
Segmenting small regions in the presence of noise
Binary segmentation, a problem of extracting foreground objects from the background, often arises in medical imaging and document processing. Popular existing solutions include Ex...
Rashi Samur, Vitali Zagorodnov
CVPR
2005
IEEE
14 years 9 months ago
Matching with PROSAC - Progressive Sample Consensus
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
Ondrej Chum, Jiri Matas
PAMI
2010
160views more  PAMI 2010»
13 years 6 months ago
Photometric Stereo via Expectation Maximization
—This paper presents a robust and automatic approach to photometric stereo, where the two main components, namely surface normals and visible surfaces, are respectively optimized...
Tai-Pang Wu, Chi-Keung Tang