Sciweavers

1236 search results - page 9 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
CORR
2007
Springer
103views Education» more  CORR 2007»
13 years 7 months ago
Physical limits of inference
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...
David H. Wolpert
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
13 years 11 months ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin
CORR
2008
Springer
159views Education» more  CORR 2008»
13 years 7 months ago
Stochastic Limit-Average Games are in EXPTIME
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
Krishnendu Chatterjee, Rupak Majumdar, Thomas A. H...
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 9 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
IPL
2006
99views more  IPL 2006»
13 years 7 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti