Sciweavers

736 search results - page 84 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
TACAS
2010
Springer
146views Algorithms» more  TACAS 2010»
14 years 2 months ago
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
Byron Cook, Daniel Kroening, Philipp Rümmer, ...
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
14 years 1 days ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
RP
2010
Springer
118views Control Systems» more  RP 2010»
13 years 5 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
DAC
1998
ACM
14 years 8 months ago
A Video Signal Processor for MIMD Multiprocessing
The video signal processor AxPe1280V has been developed for implementation of different video coding applications according to standards like ITU-T H.261/H.263, and ISO MPEG-1/2. ...
Dirk Niggemeyer, Jörg Hilgenstock, Jan Otters...
DAC
2002
ACM
14 years 8 months ago
A flexible accelerator for layer 7 networking applications
In this paper, we present a flexible accelerator designed for networking applications. The accelerator can be utilized efficiently by a variety of Network Processor designs. Most ...
Gokhan Memik, William H. Mangione-Smith