Sciweavers

352 search results - page 36 / 71
» On implementation choices for iterative improvement partitio...
Sort
View
DAC
1997
ACM
14 years 1 months ago
Methodology for Behavioral Synthesis-Based Algorithm-Level Design Space Exploration: DCT Case Study
: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent DCT algorithms and select one which i...
Miodrag Potkonjak, Kyosun Kim, Ramesh Karri
SIGMETRICS
1992
ACM
145views Hardware» more  SIGMETRICS 1992»
14 years 1 months ago
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
Victor F. Nicola, Asit Dan, Daniel M. Dias
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 10 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
EVOW
2006
Springer
14 years 23 days ago
Optimisation of Constant Matrix Multiplication Operation Hardware Using a Genetic Algorithm
Abstract. The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems. Prev...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
PPOPP
2003
ACM
14 years 2 months ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen