3505 search results - page 225 / 701 » Information Theory and the IrisCode |
168
click to vote
ISCIS
2004
Springer
16 years 2 hour ago
2004
Springer
This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book “Formal Concept Analysis” by Ganter and Wille, in the Isabelle/H...
140
click to vote
ICALP
1999
Springer
15 years 11 months ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
193
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
149
click to vote
ALT
2010
Springer
15 years 8 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...
160
click to vote
COLING
2008
15 years 8 months ago
2008
We propose a spatio-temporal markup for the annotation of motion predicates in text, informed by a lexical semantic classification of these verbs. We incorporate this classificati...