Sciweavers

8259 search results - page 63 / 1652
» On Generalized Feistel Networks
Sort
View
TMC
2012
11 years 11 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi
CORR
2012
Springer
214views Education» more  CORR 2012»
12 years 4 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
11 years 11 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...
CORR
2012
Springer
210views Education» more  CORR 2012»
12 years 4 months ago
Topological phase transition in a network model with preferential attachment and node removal
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. U...
Heiko Bauke, Cristopher Moore, Jean-Baptiste Rouqu...
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
11 years 11 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns