611 search results - page 93 / 123 » Index Sets of Computable Structures with Decidable Theories |
SIGMOD
2006
ACM
14 years 9 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
CICLING
2003
Springer
14 years 2 months ago
2003
Springer
A new sort of generative grammar (Sec2) will be demonstrated which is more radically “lexicalist” than any earlier one (Sec1). It is a modified Unification Categorial Gramma...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
WIA
2009
Springer
14 years 3 months ago
2009
Springer
FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy pro...
TIT
2010
13 years 3 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...