Sciweavers

1578 search results - page 184 / 316
» Algorithmic randomness of continuous functions
Sort
View
ECCV
2002
Springer
14 years 10 months ago
Stereo Matching Using Belief Propagation
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF's). These three MRF's model a smooth fie...
Jian Sun, Heung-Yeung Shum, Nanning Zheng
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 9 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ILP
2004
Springer
14 years 2 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
APPROX
2010
Springer
148views Algorithms» more  APPROX 2010»
13 years 10 months ago
Learning and Lower Bounds for AC0 with Threshold Gates
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
Parikshit Gopalan, Rocco A. Servedio
FUIN
2008
98views more  FUIN 2008»
13 years 9 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný