706 search results - page 136 / 142 » On a quasi-ordering on Boolean functions |
IJFCS
2007
13 years 7 months ago
2007
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
JEI
2000
13 years 7 months ago
2000
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...