Sciweavers

598 search results - page 28 / 120
» A random graph model for massive graphs
Sort
View
AI
2008
Springer
13 years 11 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 5 months 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
ICML
2004
IEEE
14 years 11 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
CCS
2010
ACM
13 years 10 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
TSP
2011
197views more  TSP 2011»
13 years 5 months ago
Group Object Structure and State Estimation With Evolving Networks and Monte Carlo Methods
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...
Amadou Gning, Lyudmila Mihaylova, Simon Maskell, S...