Sciweavers

6299 search results - page 1225 / 1260
» Data and Computation Abstractions for Dynamic and Irregular ...
Sort
View
PPOPP
2012
ACM
14 years 1 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
13 years 8 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman
DAC
2000
ACM
16 years 6 months ago
Code compression for low power embedded system design
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
Haris Lekatsas, Jörg Henkel, Wayne Wolf
VLDB
2008
ACM
170views Database» more  VLDB 2008»
16 years 6 months ago
A multi-ranker model for adaptive XML searching
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
Ho Lam Lau, Wilfred Ng
HRI
2010
ACM
16 years 21 days ago
Validating interaction patterns in HRI
— In recent work, “interaction patterns” have been proposed as a means to characterize essential features of humanrobot interaction. A problem arises, however, in knowing whe...
Peter H. Kahn Jr., Brian T. Gill, Aimee L. Reicher...
« Prev « First page 1225 / 1260 Last » Next »