192 search results - page 32 / 39 » On Graph Isomorphism for Restricted Graph Classes |
94
Voted
SDM
2004
SIAM
15 years 1 months ago
2004
SIAM
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
109
click to vote
COCO
2000
Springer
15 years 4 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
104
Voted
PODS
2004
ACM
15 years 11 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
84
Voted
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
DAC
1999
ACM
16 years 18 days ago
1999
ACM
Abstract? Fixed-point DSPs are a class of embedded processors with highly irregular architectures. This irregularity makes it difficult to generate high-quality machine code from p...