Sciweavers

1401 search results - page 75 / 281
» Randomness in Interactive Proofs
Sort
View
ACCV
2009
Springer
15 years 4 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
ATAL
2008
Springer
14 years 11 months ago
Multi-robot Markov random fields
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...
Jesse Butterfield, Odest Chadwicke Jenkins, Brian ...
PRL
2000
62views more  PRL 2000»
14 years 9 months ago
Interactive initialization of the multilayer perceptron
A new multilayer preceptor initialization method is proposed and compared experimentally with a traditional random initialization method. An operator maps training-set vectors int...
Aistis Raudys

Publication
281views
16 years 9 months ago
Modeling Image Textures by Gibbs Random Fields
Drawbacks of the traditional scenario of image modeling by Gibbs random fields with multiple pairwise pixel interactions are outlined, and a more reasonable alternative scenario b...
Georgy Gimel'farb
FOCS
2009
IEEE
15 years 4 months ago
A Parallel Repetition Theorem for Any Interactive Argument
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
Iftach Haitner