Sciweavers

7380 search results - page 397 / 1476
» time 2008
Sort
View
PVLDB
2010
90views more  PVLDB 2010»
15 years 5 months ago
The HV-tree: a Memory Hierarchy Aware Version Index
The huge amount of temporal data generated from many important applications call for a highly efficient and scalable version index. The TSB-tree has the potential of large scalab...
Rui Zhang, Martin Stradling
RECOMB
2008
Springer
16 years 7 months ago
Algorithms for Exploring the Space of Gene Tree/Species Tree Reconciliations
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
Jean-Philippe Doyon, Cedric Chauve, Sylvie Hamel
IJRR
2008
107views more  IJRR 2008»
15 years 6 months ago
Caging Polygons with Two and Three Fingers
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Mostafa Vahedi, A. Frank van der Stappen
VLSISP
2008
145views more  VLSISP 2008»
15 years 6 months ago
Area, Delay, and Power Characteristics of Standard-Cell Implementations of the AES S-Box
Cryptographic substitution boxes (S-boxes) are an integral part of modern block ciphers like the Advanced Encryption Standard (AES). There exists a rich literature devoted to the ...
Stefan Tillich, Martin Feldhofer, Thomas Popp, Joh...
TPDS
1998
92views more  TPDS 1998»
15 years 6 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu