1542 search results - page 231 / 309 » The metamathematics of random graphs |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
103
Voted
MSS
2008
IEEE
15 years 1 months ago
2008
IEEE
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...
163
click to vote
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
125
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...