Sciweavers

2434 search results - page 258 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ALGORITHMICA
1998
103views more  ALGORITHMICA 1998»
15 years 3 months ago
On Bayes Methods for On-Line Boolean Prediction
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
Nicolò Cesa-Bianchi, David P. Helmbold, San...
178
Voted
AAAI
2012
13 years 6 months ago
Online Task Assignment in Crowdsourcing Markets
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
Chien-Ju Ho, Jennifer Wortman Vaughan
ECCV
2006
Springer
16 years 6 months ago
Learning to Combine Bottom-Up and Top-Down Segmentation
Bottom-up segmentation based only on low-level cues is a notoriously difficult problem. This difficulty has lead to recent top-down segmentation algorithms that are based on class-...
Anat Levin, Yair Weiss
ICASSP
2008
IEEE
15 years 10 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 7 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch