Sciweavers

1510 search results - page 91 / 302
» Upper Probabilities and Additivity
Sort
View
ARITH
2005
IEEE
15 years 3 months ago
N-Bit Unsigned Division via N-Bit Multiply-Add
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
Arch D. Robison
EUROPAR
2005
Springer
15 years 3 months ago
Improving Instruction Delivery with a Block-Aware ISA
Instruction delivery is a critical component for wide-issue processors since its bandwidth and accuracy place an upper limit on performance. The processor front-end accuracy and ba...
Ahmad Zmily, Earl Killian, Christos Kozyrakis
ICCS
2005
Springer
15 years 3 months ago
Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
Ion I. Mandoiu, Claudia Prajescu, Dragos Trinca
CPM
2004
Springer
94views Combinatorics» more  CPM 2004»
15 years 3 months ago
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
Firas Swidan, Michael A. Bender, Dongdong Ge, Sima...
EUROCRYPT
2004
Springer
15 years 3 months ago
Optimal Communication Complexity of Generic Multicast Key Distribution
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
Daniele Micciancio, Saurabh Panjwani