Sciweavers

1945 search results - page 367 / 389
» Speeding up Serpent
Sort
View
FCCM
1997
IEEE
199views VLSI» more  FCCM 1997»
14 years 20 days ago
The RAW benchmark suite: computation structures for general purpose computing
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...
Jonathan Babb, Matthew Frank, Victor Lee, Elliot W...
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
14 years 19 days ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
14 years 19 days ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
VLDB
1997
ACM
126views Database» more  VLDB 1997»
14 years 18 days ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
14 years 18 days ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng