Sciweavers

2020 search results - page 64 / 404
» Speeding up Slicing
Sort
View
IPPS
2000
IEEE
14 years 2 months ago
A Novel Superscalar Architecture for Fast DCT Implementation
This paper presents a new superscalar architecture for fast discrete cosine transform (DCT). Comparing with the general SIMD architecture, it speeds up the DCT computation by a fac...
Zhang Yong, Min Zhang
DEXA
1999
Springer
181views Database» more  DEXA 1999»
14 years 2 months ago
Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases
In this paper, a new indexing technique to support the query evaluation in document databases is proposed. The key idea of the method is the combination of the technique of pat-tre...
Yangjun Chen, Karl Aberer
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
14 years 1 months ago
On Weil Polynomials of K3 Surfaces
Abstract. For K3 surfaces, we derive some conditions the characteristic polynomial of the Frobenius on the ´etale cohomology must satisfy. These conditions may be used to speed up...
Andreas-Stephan Elsenhans, Jörg Jahnel
ASPDAC
2000
ACM
133views Hardware» more  ASPDAC 2000»
14 years 1 months ago
A VLSI implementation of the blowfish encryption/decryption algorithm
We propose an efficient hardware architecture for the Blowfish algorithm [1]. The speed is up to 4 bit/clock, which is 9 times faster than a Pentium. By applying operator-reschedul...
Michael C.-J. Lin, Youn-Long Lin
BNCOD
2001
101views Database» more  BNCOD 2001»
13 years 11 months ago
Limiting Result Cardinalities for Multidatabase Queries Using Histograms
Abstract. Integrating, cleaning and analyzing data from heterogeneous sources is often complicated by the large amounts of data and its physical distribution which can result in po...
Kai-Uwe Sattler, Oliver Dunemann, Ingolf Geist, Gu...