Sciweavers

1089 search results - page 167 / 218
» Randomness and Reducibility
Sort
View
ACCV
2010
Springer
13 years 4 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
COLING
2010
13 years 4 months ago
A Comparison of Models for Cost-Sensitive Active Learning
Active Learning (AL) is a selective sampling strategy which has been shown to be particularly cost-efficient by drastically reducing the amount of training data to be manually ann...
Katrin Tomanek, Udo Hahn
IJRR
2011
174views more  IJRR 2011»
13 years 4 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
JAIR
2011
129views more  JAIR 2011»
13 years 4 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek
TCS
2011
13 years 4 months ago
Smart PAC-learners
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
Malte Darnstädt, Hans-Ulrich Simon