Sciweavers

8294 search results - page 845 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
191
Voted
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 12 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
210
Voted
PDP
2006
IEEE
16 years 1 months ago
An Experimental Validation of the PRO Model for Parallel and Distributed Computation
— The Parallel Resource-Optimal (PRO) computation model was introduced by Gebremedhin et al. [2002] as a framework for the design and analysis of efficient parallel algorithms. ...
Mohamed Essaïdi, Jens Gustedt
166
Voted
STACS
2005
Springer
16 years 1 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
200
Voted
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
16 years 1 months ago
Provably Secure Masking of AES
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
Johannes Blömer, Jorge Guajardo, Volker Krumm...
IPPS
2003
IEEE
16 years 29 days ago
Performing DNA Comparison on a Bio-Inspired Tissue of FPGAs
String comparison is a critical issue in many application domains, including speech recognition, contents search, and bioinformatics. The similarity between two strings of lengths...
Matteo Canella, Filippo Miglioli, Alessandro Bogli...