2168 search results - page 425 / 434 » Randomized Algorithms and Complexity Theory |
IWQOS
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
114
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
111
click to vote
AIPS
2009
15 years 21 days ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
112
click to vote
JMIV
2006
14 years 11 months ago
2006
In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simp...
103
click to vote
LATINCRYPT
2010
14 years 10 months ago
2010
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...