Sciweavers

194 search results - page 16 / 39
» Randomness for Free
Sort
View
FOCS
1990
IEEE
14 years 14 days ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 8 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
OPODIS
2010
13 years 6 months ago
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
Achour Mostéfaoui, Michel Raynal
JAR
2008
88views more  JAR 2008»
13 years 8 months ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
ISCAS
2007
IEEE
207views Hardware» more  ISCAS 2007»
14 years 2 months ago
Low-delay View Random Access for Multi-view Video Coding
—Multi-view video coding is becoming a very active research topic, as multi-view video system provides the interactive feature which makes viewers experience the free viewpoint n...
Yanwei Liu, Qingming Huang, Debin Zhao, Wen Gao