Sciweavers

3247 search results - page 141 / 650
» Randomized smoothing networks
Sort
View
JMLR
2010
145views more  JMLR 2010»
14 years 11 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever
AAAI
2011
14 years 4 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
NETWORK
2007
132views more  NETWORK 2007»
15 years 3 months ago
Load balancing for cellular/WLAN integrated networks
– The interworking between the third-generation (3G) cellular network and wireless local area networks (WLANs) is one of the promising approaches to next-generation wireless netw...
Wei Song, Weihua Zhuang, Yu Cheng
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 4 months ago
Random Topologies and the emergence of cooperation: the role of short-cuts
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
Daniele Vilone, Angel Sánchez, Jesús...
MST
2000
101views more  MST 2000»
15 years 3 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...