Sciweavers

1229 search results - page 151 / 246
» On the gaussian distribution of strings
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 9 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
COMCOM
2004
145views more  COMCOM 2004»
15 years 6 months ago
Framework based on stochastic L-Systems for modeling IP traffic with multifractal behavior
In a previous work we have introduced a multifractal traffic model based on so-called stochastic L-Systems, which were introduced by biologist A. Lindenmayer as a method to model ...
Paulo Salvador, António Nogueira, Rui T. Va...
EATCS
1998
250views more  EATCS 1998»
15 years 6 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
ICGI
2010
Springer
15 years 4 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà