1139 search results - page 81 / 228 » Bounded Ideation Theory |
ALT
2010
Springer
13 years 10 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
WEWORC
2007
13 years 10 months ago
2007
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
APAL
2010
13 years 9 months ago
2010
We discover geometric properties of certain definable sets over non-Archimedean valued fields with analytic structures. Results include a parameterized smooth stratification theore...
ECCC
2007
13 years 9 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
DAM
2000
13 years 9 months ago
2000
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...