694 search results - page 65 / 139 » Open Graphs and Computational Reasoning |
126
click to vote
ALMOB
2006
15 years 1 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
106
click to vote
SEMWEB
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Ontology classification--the computation of subsumption hierarchies for classes and properties--is one of the most important tasks for OWL reasoners. Based on the algorit...
120
click to vote
CIKM
2010
Springer
14 years 12 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
121
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
110
click to vote
EUROCOLT
1995
Springer
15 years 5 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...