Sciweavers

250 search results - page 37 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
14 years 10 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
TWC
2008
110views more  TWC 2008»
14 years 9 months ago
Information outage probability and diversity order of symmetric coordinate interleaved orthogonal designs
Space-time block codes (STBCs) from coordinate interleaved orthogonal designs (CIODs) have attracted considerable attention lately due to their full-diversity and single-symbol dec...
Hoojin Lee, Jeffrey G. Andrews, Edward J. Powers
OPODIS
2010
14 years 7 months ago
Tardiness Bounds for Global EDF with Deadlines Different from Periods
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Jeremy Erickson, Nan Guan, Sanjoy K. Baruah
PICS
2003
14 years 10 months ago
Selection of Training Sets for the Characterisation of Multispectral Imaging Systems
To establish a correlation between the system output and the corresponding reflectance, the system characterisation functionDeriving the actual multispectral data from the output o...
Paolo Pellegri, Gianluca Novati, Raimondo Schettin...
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 7 days ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown