Sciweavers

2996 search results - page 282 / 600
» Numberings and Randomness
Sort
View
DATE
2003
IEEE
98views Hardware» more  DATE 2003»
16 years 53 min ago
On the Characterization of Hard-to-Detect Bridging Faults
We investigate a characterization of hard-to-detect bridging faults. For circuits with large numbers of lines (or nodes), this characterization can be used to select target faults...
Irith Pomeranz, Sudhakar M. Reddy, Sandip Kundu
DAWAK
2000
Springer
15 years 11 months ago
Data Cube Compression with QuantiCubes
: Data warehouses typically store a multidimensional fact representation of the data that can be used in any type of analysis. Many applications materialize data cubes as multidime...
Pedro Furtado, Henrique Madeira
RANDOM
1999
Springer
15 years 11 months ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
15 years 11 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
EUROCRYPT
1998
Springer
15 years 11 months ago
Strengthened Security for Blind Signatures
Abstract. Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. Mo...
David Pointcheval