219 search results - page 15 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
150
Voted
DAGSTUHL
2004
15 years 7 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
161
click to vote
CORR
2010
Springer
15 years 29 days ago
2010
Springer
We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel wh...
164
click to vote
TCOM
2010
15 years 4 months ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
171
click to vote
NAACL
2004
15 years 7 months ago
2004
Maximum entropy models are a common modeling technique, but prone to overfitting. We show that using an exponential distribution as a prior leads to bounded absolute discounting b...
156
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...