3247 search results - page 48 / 650 » Randomized smoothing networks |
101
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
JMLR
2010
14 years 6 months ago
2010
We propose a non-linear graphical model for structured prediction. It combines the power of deep neural networks to extract high level features with the graphical framework of Mar...
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
NCA
2006
IEEE
15 years 5 months ago
2006
IEEE
Clustered sensor networks have been shown to increase system throughput, decrease system delay, and save energy. While those with rotating cluster heads, such as LEACH, have also ...
104
click to vote
STOC
2004
ACM
15 years 5 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...