5100 search results - page 843 / 1020 » The Linear Complexity of a Graph |
161
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
151
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
145
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
162
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
149
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...