Sciweavers

5606 search results - page 264 / 1122
» Randomization Techniques for Graphs.
Sort
View
INFOCOM
2010
IEEE
15 years 5 months ago
Randomized Differential DSSS: Jamming-Resistant Wireless Broadcast Communication
—Jamming resistance is crucial for applications where reliable wireless communication is required. Spread spectrum techniques such as Frequency Hopping Spread Spectrum (FHSS) and...
Yao Liu, Peng Ning, Huaiyu Dai, An Liu
ICML
2007
IEEE
16 years 7 months ago
Parameter learning for relational Bayesian networks
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...
Manfred Jaeger
FOCS
2009
IEEE
16 years 1 months ago
Convergence to Equilibrium in Local Interaction Games
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
Andrea Montanari, Amin Saberi
ICC
2008
IEEE
142views Communications» more  ICC 2008»
16 years 28 days ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...