Sciweavers

4451 search results - page 677 / 891
» On Random Ordering Constraints
Sort
View
COLT
2010
Springer
15 years 3 months ago
Nonparametric Bandits with Covariates
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
Philippe Rigollet, Assaf Zeevi
CORR
2011
Springer
198views Education» more  CORR 2011»
15 years 1 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
COLING
2010
15 years 1 months ago
Automatic Persian WordNet Construction
In this paper, an automatic method for Persian WordNet construction based on Prenceton WordNet 2.1 (PWN) is introduced. The proposed approach uses Persian and English corpora as w...
Mortaza Montazery, Feshaam Faili
IJCV
2011
152views more  IJCV 2011»
15 years 1 months ago
Recovering Occlusion Boundaries from an Image
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
Derek Hoiem, Alexei A. Efros, Martial Hebert
JAIR
2011
129views more  JAIR 2011»
15 years 1 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