Sciweavers

63 search results - page 5 / 13
» A New Algorithm for Sampling CSP Solutions Uniformly at Rand...
Sort
View
EUROCOLT
1999
Springer
14 years 3 days ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
TOG
2012
582views Communications» more  TOG 2012»
11 years 10 months ago
Synthesis of detailed hand manipulations using contact sampling
Capturing human activities that involve both gross full-body motion and detailed hand manipulation of objects is challenging for standard motion capture systems. We introduce a ne...
Yuting Ye, C. Karen Liu
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
FOCS
2009
IEEE
14 years 2 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICRA
2009
IEEE
119views Robotics» more  ICRA 2009»
14 years 2 months ago
Survivability: Measuring and ensuring path diversity
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...
Lawrence H. Erickson, Steven M. LaValle