3457 search results - page 353 / 692 » A Symbol Is Not a Symbol |
172
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
165
click to vote
ICGI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
198
click to vote
ICGI
2000
Springer
15 years 10 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
169
click to vote
IDEAL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. An off-line hand-written Chinese character recognizer supporting a vocabulary of 4,616 Chinese characters, alphanumerics and punctuation symbols has been reported. Traine...
149
click to vote
MFCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...