430 search results - page 41 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
KDD
2001
ACM
15 years 11 months ago
2001
ACM
Building predictive models and finding useful rules are two important tasks of data mining. While building predictive models has been well studied, finding useful rules for action...
EDBT
2008
ACM
15 years 10 months ago
2008
ACM
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
SPAA
1993
ACM
15 years 2 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
ACSC
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
102
click to vote
LICS
2003
IEEE
15 years 4 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...