526 search results - page 60 / 106 » On the Number of Minimal Addition Chains |
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
AUSAI
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
DAC
1995
ACM
15 years 1 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
103
click to vote
JSAC
2006
14 years 9 months ago
2006
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...
TSP
2008
14 years 9 months ago
2008
A random access protocol named ALLIANCES was recently proposed, that achieves high throughput by resolving collisions in wireless networks. ALLIANCES exploits diversity provided b...