587 search results - page 59 / 118 » On the Relative Sizes of Learnable Sets |
PAKDD
2000
ACM
14 years 9 days ago
2000
ACM
This paper addresses personal E-mail filtering by casting it in the framework of text classification. Modeled as semi-structured documents, Email messages consist of a set of field...
ICDT
1995
ACM
14 years 9 days ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
DM
2008
13 years 8 months ago
2008
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
APAL
2006
13 years 8 months ago
2006
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
IS
2007
13 years 8 months ago
2007
Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purp...