154
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
150
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
147
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
Abstract—This study considers an orthogonal frequencydivision multiple-access (OFDMA)-based multi-user two-way relay network where multiple mobile stations (MSs) communicate with...
130
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
156
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
191
Voted
CORR
2012
Springer
14 years 12 days ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
CORR
2012
Springer
14 years 12 days ago
2012
Springer
CORR
2012
Springer
14 years 12 days ago
2012
Springer
161
click to vote
CORR
2012
Springer
14 years 12 days ago
2012
Springer
—IEEE 802.11 DCF is the MAC protocol currently used in wireless LANs. 802.11 DCF is inefficient due to two types of overhead; channel idle time and collision time. This paper pr...