Sciweavers

359 search results - page 4 / 72
» On Complete Primitives for Fairness
Sort
View
ICIAP
2001
Springer
14 years 7 months ago
Intermediate Representation in Model Based Recognition Using Straight Line and Ellipsoidal Arc Primitives
An intermediate representation suitable for the 2-D recognition of the 3-D objects, from a single intensity image is proposed. Determination of the intermediate representation fro...
Sergiu Nedevschi, Tiberiu Marita, Daniela Puiu
CRYPTO
2000
Springer
89views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
On the Round Security of Symmetric-Key Cryptographic Primitives
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of...
Zulfikar Ramzan, Leonid Reyzin
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 1 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
ICCD
2004
IEEE
107views Hardware» more  ICCD 2004»
14 years 4 months ago
Analyzing Power Consumption of Message Passing Primitives in a Single-Chip Multiprocessor
In this work we propose a methodology for the accurate analysis of the power consumption of interprocessor communication in a MPSoC, and the construction of high-level power macro...
Mirko Loghi, Luca Benini, Massimo Poncino
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
13 years 11 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin