1414 search results - page 161 / 283 » Randomness and Universal Machines |
110
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
In this paper, we use large neighborhood Markov random fields to learn rich prior models of color images. Our approach extends the monochromatic Fields of Experts model (Roth &...
183
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
135
Voted
ALT
2007
Springer
16 years 12 days ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
132
click to vote
MINENET
2006
ACM
15 years 9 months ago
2006
ACM
We examine the ability to exploit the hierarchical structure of Internet addresses in order to endow network agents with predictive capabilities. Specifically, we consider Suppor...
118
click to vote
COLT
1999
Springer
15 years 7 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...