10997 search results - page 110 / 2200 » On the Structure of Complete Sets |
121
click to vote
BSL
2008
15 years 6 months ago
2008
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
286
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
176
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
151
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
152
click to vote
ECOOP
1998
Springer
15 years 10 months ago
1998
Springer
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...