Sciweavers

9209 search results - page 176 / 1842
» Data Space Randomization
Sort
View
ECCV
2006
Springer
16 years 7 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
164
Voted
INFOCOM
2008
IEEE
15 years 11 months ago
Link Lifetimes and Randomized Neighbor Selection in DHTs
—Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to clas...
Zhongmei Yao, Dmitri Loguinov
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 9 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
161
Voted
BMCBI
2006
105views more  BMCBI 2006»
15 years 5 months ago
CRNPRED: highly accurate prediction of one-dimensional protein structures by large-scale critical random networks
Background: One-dimensional protein structures such as secondary structures or contact numbers are useful for three-dimensional structure prediction and helpful for intuitive unde...
Akira R. Kinjo, Ken Nishikawa
BC
2002
193views more  BC 2002»
15 years 4 months ago
Resonant spatiotemporal learning in large random recurrent networks
Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives...
Emmanuel Daucé, Mathias Quoy, Bernard Doyon