Sciweavers

534 search results - page 49 / 107
» Power from Random Strings
Sort
View
EUROCRYPT
2004
Springer
14 years 3 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer
FLAIRS
2004
13 years 11 months ago
Mining On-line Sources for Definition Knowledge
Finding definitions in huge text collections is a challenging problem, not only because of the many ways in which definitions can be conveyed in natural language texts but also be...
Horacio Saggion, Robert J. Gaizauskas
CC
2007
Springer
108views System Software» more  CC 2007»
13 years 10 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
EATCS
1998
250views more  EATCS 1998»
13 years 9 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é
ICASSP
2008
IEEE
14 years 4 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...