Sciweavers

265 search results - page 19 / 53
» A Scheme for Approximating Probabilistic Inference
Sort
View
ICMLA
2008
13 years 10 months ago
Probabilistic Exploitation of the Lucas and Kanade Smoothness Constraint
The basic idea of Lucas and Kanade is to constrain the local motion measurement by assuming a constant velocity within a spatial neighborhood. We reformulate this spatial constrai...
Volker Willert, Julian Eggert, Marc Toussaint, Edg...
ENTCS
2008
91views more  ENTCS 2008»
13 years 8 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
DCC
2008
IEEE
14 years 8 months ago
Improved versions of Tardos' fingerprinting scheme
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
Oded Blayer, Tamir Tassa
RSCTC
2004
Springer
134views Fuzzy Logic» more  RSCTC 2004»
14 years 2 months ago
Rough Set Methods in Approximation of Hierarchical Concepts
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
Jan G. Bazan, Sinh Hoa Nguyen, Hung Son Nguyen, An...
IJCAI
1997
13 years 10 months ago
Combining Probabilistic Population Codes
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
Richard S. Zemel, Peter Dayan