3008 search results - page 232 / 602 » Independence in connected graphs |
181
click to vote
LOPSTR
2007
Springer
16 years 23 days ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
152
click to vote
SAC
2006
ACM
16 years 18 days ago
2006
ACM
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
171
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
218
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
166
Voted
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...