2084 search results - page 278 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
100
click to vote
EWSN
2006
Springer
15 years 9 months ago
2006
Springer
Nodes in sensor networks often encounter spatially-correlated contention, where multiple nodes in the same neighborhood all sense an event they need to transmit information about....
SI3D
2006
ACM
15 years 3 months ago
2006
ACM
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
CDC
2010
IEEE
14 years 5 months ago
2010
IEEE
We consider the problem of dynamic buying and selling of shares from a collection of N stocks with random price fluctuations. To limit investment risk, we place an upper bound on t...
100
click to vote
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
116
click to vote
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...