Sciweavers

1457 search results - page 125 / 292
» On the Uniform Distribution of Strings
Sort
View
ICML
2009
IEEE
16 years 1 months ago
Grammatical inference as a principal component analysis problem
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
Raphaël Bailly, François Denis, Liva R...
EUROCRYPT
2007
Springer
16 years 12 days ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
ESCIENCE
2007
IEEE
15 years 10 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
JDCTA
2008
85views more  JDCTA 2008»
15 years 6 months ago
A Non Scale Free Attribute of Convergent Address Window for Private Messaging
A convergent address window of web browsers accepts a destination address and a message string. The destination address can be domain names or any other form of addresses and is i...
Young S. Han
CORR
1999
Springer
71views Education» more  CORR 1999»
15 years 5 months ago
New Error Bounds for Solomonoff Prediction
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when i...
Marcus Hutter