1351 search results - page 182 / 271 » Learning from compressed observations |
121
click to vote
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
132
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
In this work we present Discriminative Random Fields (DRFs), a discriminative framework for the classification of image regions by incorporating neighborhood interactions in the l...
130
click to vote
GPEM
2000
15 years 4 months ago
2000
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
132
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of learning a coefficient vector x0 ∈ RN from noisy linear observation y = Ax0 + w ∈ Rn . In many contexts (ranging from model selection to image proce...
168
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...