Sciweavers

1515 search results - page 168 / 303
» Prediction without markets
Sort
View
NDSS
2009
IEEE
15 years 11 months ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
LATA
2010
Springer
15 years 11 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
ICASSP
2008
IEEE
15 years 11 months ago
A no-reference perceptual blockiness metric
A novel no-reference blockiness metric that can automatically and perceptually quantify blocking artifacts of DCT coding is presented. The proposed metric is built upon the specif...
Hantao Liu, Ingrid Heynderickx
ICC
2008
IEEE
100views Communications» more  ICC 2008»
15 years 11 months ago
Power Scheduling for MIMO Relay Channels Employing Rateless Codes
—We propose a simple power scheduling algorithm for relay channels with multiple antennas. The algorithm combines seamlessly with a low complexity communication protocol that emp...
Youjian Liu, Mahesh K. Varanasi, Xinming Huang
ICRA
2008
IEEE
119views Robotics» more  ICRA 2008»
15 years 11 months ago
Maximum likelihood estimation of sensor and action model functions on a mobile robot
— In order for a mobile robot to accurately interpret its sensations and predict the effects of its actions, it must have accurate models of its sensors and actuators. These mode...
Daniel Stronger, Peter Stone