Sciweavers

968 search results - page 9 / 194
» A faster implementation of APlace
Sort
View
EUROCRYPT
2009
Springer
14 years 10 months ago
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
Steven D. Galbraith, Xibin Lin, Michael Scott
IROS
2007
IEEE
144views Robotics» more  IROS 2007»
14 years 4 months ago
Faster and more accurate face detection on mobile robots using geometric constraints
— We develop a framework to allow generic object detection algorithms to exploit geometric information commonly available to robot vision systems. Robot systems take pictures wit...
Michael Dixon, Frederick Heckel, Robert Pless, Wil...
PODC
2010
ACM
14 years 1 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
DATE
2006
IEEE
202views Hardware» more  DATE 2006»
14 years 3 months ago
Automatic systemC design configuration for a faster evaluation of different partitioning alternatives
In this paper we present a methodology that is based on SystemC [1] for rapid prototyping to greatly enhance and accelerate the exploration of complex systems to optimize the syst...
Nico Bannow, Karsten Haug, Wolfgang Rosenstiel
USENIX
2003
13 years 11 months ago
Operating System I/O Speculation: How Two Invocations Are Faster Than One
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design withi...
Keir Faser, Fay Chang