Sciweavers

1083 search results - page 89 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
ASAP
2004
IEEE
127views Hardware» more  ASAP 2004»
15 years 1 months ago
A Public-Key Cryptographic Processor for RSA and ECC
We describe a general-purpose processor architecture for accelerating public-key computations on server systems that demand high performance and flexibility to accommodate large n...
Hans Eberle, Nils Gura, Sheueling Chang Shantz, Vi...
ASIACRYPT
2004
Springer
15 years 3 months ago
Masking Based Domain Extenders for UOWHFs: Bounds and Constructions
We study the class of masking based domain extenders for UOWHFs. Our first contribution is to show that any correct masking based domain extender for UOWHF which invokes the compr...
Palash Sarkar
AAAI
2007
15 years 6 days ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
JSAC
2006
112views more  JSAC 2006»
14 years 9 months ago
Optimal Bandwidth Allocation in a Delay Channel
In this paper, we consider the problem of allocating bandwidth to two queues with arbitrary arrival processes, so as to minimize the total expected packet holding cost over a finit...
Navid Ehsan, Mingyan Liu
GPEM
2002
163views more  GPEM 2002»
14 years 9 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf