Sciweavers

463 search results - page 57 / 93
» Induction in Noisy Domains
Sort
View
TLCA
2007
Springer
15 years 6 months ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
ICML
1995
IEEE
15 years 3 months ago
Learning with Rare Cases and Small Disjuncts
Systems that learn from examples often create a disjunctive concept definition. Small disjuncts are those disjuncts which cover only a few training examples. The problem with sma...
Gary M. Weiss
ECCV
2010
Springer
14 years 10 months ago
Hybrid Compressive Sampling via a New Total Variation TVL1
Compressive sampling (CS) is aimed at acquiring a signal or image from data which is deemed insufficient by Nyquist/Shannon sampling theorem. Its main idea is to recover a signal ...
Xianbiao Shu, Narendra Ahuja
ECCV
2008
Springer
16 years 1 months ago
A Generative Shape Regularization Model for Robust Face Alignment
In this paper, we present a robust face alignment system that is capable of dealing with exaggerating expressions, large occlusions, and a wide variety of image noises. The robustn...
Leon Gu, Takeo Kanade
ICML
2009
IEEE
16 years 19 days ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint