Sciweavers

1369 search results - page 131 / 274
» A Practical Implementation of the Timing Attack
Sort
View
IPL
2002
119views more  IPL 2002»
14 years 11 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
IACR
2011
112views more  IACR 2011»
13 years 10 months ago
Improved Generic Algorithms for Hard Knapsacks
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
Anja Becker, Jean-Sébastien Coron, Antoine ...
ICRA
2003
IEEE
167views Robotics» more  ICRA 2003»
15 years 4 months ago
Local exploration: online algorithms and a probabilistic framework
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
Volkan Isler, Sampath Kannan, Kostas Daniilidis
ATAL
2008
Springer
15 years 1 months ago
Demonstration of multi-agent potential fields in real-time strategy games
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...
Johan Hagelbäck, Stefan J. Johansson
82
Voted
CCS
2007
ACM
15 years 5 months ago
An analysis of browser domain-isolation bugs and a light-weight transparent defense mechanism
Browsers’ isolation mechanisms are critical to users’ safety and privacy on the web. Achieving proper isolations, however, is very difficult. Historical data show that even fo...
Shuo Chen, David Ross, Yi-Min Wang