Sciweavers

2100 search results - page 373 / 420
» Fundamentals of the problem
Sort
View
FOCS
2002
IEEE
14 years 2 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
ICRA
2002
IEEE
152views Robotics» more  ICRA 2002»
14 years 2 months ago
Mobile Robot Self-Localization in Large-Scale Environments
— This paper presents a new approach for the absolute self-localization of a mobile robot in structured large-scale environments. The requirements with regard to both, the necess...
Axel Lankenau, Thomas Röfer
WADS
2001
Springer
126views Algorithms» more  WADS 2001»
14 years 1 months ago
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
IPPS
2000
IEEE
14 years 1 months ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
HICSS
1999
IEEE
153views Biometrics» more  HICSS 1999»
14 years 1 months ago
Search Patterns in Hypertext Exhibits
As access to hypermedia documents becomes generally available, it becomes increasingly important to understand how casual users search for information. We have studied search patt...
Joan C. Nordbotten, Svein Nordbotten