Sciweavers

181 search results - page 24 / 37
» On Quantification with A Finite Universe
Sort
View
BIRTHDAY
2010
Springer
13 years 5 months ago
Database Theory, Yuri, and Me
Yuri Gurevich made many varied and deep contributions to logic for computer science. Logic provides also the theoretical foundation of database systems. Hence, it is almost unavoid...
Jan Van den Bussche
CSL
2008
Springer
13 years 9 months ago
Quantitative Languages
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
CORR
1999
Springer
71views Education» more  CORR 1999»
13 years 7 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
MLQ
2000
99views more  MLQ 2000»
13 years 7 months ago
Von Rimscha's Transitivity Conditions
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
Paul E. Howard, Jean E. Rubin, Adrienne Stanley
CVPR
2009
IEEE
15 years 2 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)