Sciweavers

1945 search results - page 70 / 389
» Speeding up Serpent
Sort
View
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
15 years 5 months ago
Average consensus by gossip algorithms with quantized communication
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...
PARELEC
2006
IEEE
15 years 5 months ago
A Fault-Tolerant Dynamic Fetch Policy for SMT Processors in Multi-Bus Environments
Modern microprocessors get more and more susceptible to transient faults, e.g. caused by high-energetic particles due to high integration, clock frequencies, temperature and decre...
Bernhard Fechner
IPPS
2000
IEEE
15 years 3 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»
15 years 3 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»
15 years 3 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