Sciweavers

CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 11 months ago
Dynamic Range Reporting in External Memory
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...
Yakov Nekrich
DM
2002
114views more  DM 2002»
14 years 7 days ago
Existence of resolvable group divisible designs with block size four I
It is proved in this paper that for m 0; 2; 6; 10 (mod 12) there exists a resolvable group divisible design of order v, block size 4 and group size m if and only v 0 (mod 4), v ...
Hao Shen, Jiaying Shen
CORR
2004
Springer
121views Education» more  CORR 2004»
14 years 8 days ago
Worst-Case Optimal Tree Layout in a Memory Hierarchy
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
Erik D. Demaine, John Iacono, Stefan Langerman
DM
2007
129views more  DM 2007»
14 years 12 days ago
3-Designs with block size 6 from PSL(2, q) and their large sets
We investigate the existence of 3-designs and uniform large sets of 3-designs with block size 6 admitting PSL(2, q) as an automorphism group. We show the existence of simple 3-(28...
G. R. Omidi, M. R. Pournaki, Behruz Tayfeh-Rezaie
ERSA
2004
148views Hardware» more  ERSA 2004»
14 years 1 months ago
Efficient Floating-point Based Block LU Decomposition on FPGAs
In this paper, we propose an architecture for floatingpoint based LU decomposition for large-sized matrices. Our proposed architecture is based on the well known concept of blocki...
Gokul Govindu, Viktor K. Prasanna, Vikash Daga, Sr...
SNPD
2008
14 years 1 months ago
Effect of Security Increment to Symmetric Data Encryption through AES Methodology
The selective application of technological and related procedural safeguards is an important responsibility of every organization in providing adequate security to its electronic ...
Md. Nazrul Islam, Md. Monir Hossain Mia, Muhammad ...
ASPLOS
1991
ACM
14 years 4 months ago
The Cache Performance and Optimizations of Blocked Algorithms
Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorith...
Monica S. Lam, Edward E. Rothberg, Michael E. Wolf
SACRYPT
1999
Springer
119views Cryptology» more  SACRYPT 1999»
14 years 4 months ago
A Universal Encryption Standard
Abstract. DES and triple-DES are two well-known and popular encryption algorithms, but they both have the same drawback: their block size is limited to 64 bits. While the cryptogra...
Helena Handschuh, Serge Vaudenay
FOCS
2000
IEEE
14 years 4 months ago
Cache-Oblivious B-Trees
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...
HIPEAC
2009
Springer
14 years 5 months ago
Revisiting Cache Block Superloading
Abstract. Technological advances and increasingly complex and dynamic application behavior argue for revisiting mechanisms that adapt logical cache block size to application charac...
Matthew A. Watkins, Sally A. McKee, Lambert Schael...