1778 search results - page 190 / 356 » On the Power of the Randomized Iterate |
139
click to vote
SAC
2006
ACM
16 years 11 days ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
146
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity...
159
click to vote
CHES
2006
Springer
15 years 10 months ago
2006
Springer
In recent years, some countermeasures against Differential Power Analysis (DPA) at the logic level have been proposed. At CHES 2005 conference, Popp and Mangard proposed a new coun...
166
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
194
click to vote
TON
2008
15 years 6 months ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...