Sciweavers

160 search results - page 4 / 32
» Some Theorems on the Algorithmic Approach to Probability The...
Sort
View
IFIP
2004
Springer
14 years 25 days ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
IDA
2007
Springer
13 years 7 months ago
Second-order uncertainty calculations by using the imprecise Dirichlet model
Natural extension is a powerful tool for combining the expert judgments in the framework of imprecise probability theory. However, it assumes that every judgment is “true” and...
Lev V. Utkin
TIT
2010
111views Education» more  TIT 2010»
13 years 2 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
ALT
2008
Springer
14 years 4 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...