Sciweavers

5158 search results - page 780 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
JCSS
2006
77views more  JCSS 2006»
15 years 6 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter
DSS
2007
86views more  DSS 2007»
15 years 6 months ago
Efficiency of critical incident management systems: Instrument development and validation
There is much literature in the area of emergency response management systems. Even so, there is in general a lacuna of literature that deals with the issue of measuring the effec...
Jin Ki Kim, Raj Sharman, H. Raghav Rao, Shambhu J....
ECCC
2007
123views more  ECCC 2007»
15 years 6 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
JMLR
2006
103views more  JMLR 2006»
15 years 6 months ago
Pattern Recognition for Conditionally Independent Data
In this work we consider the task of relaxing the i.i.d. assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider r...
Daniil Ryabko
ML
2008
ACM
15 years 6 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill