4865 search results - page 262 / 973 » The Complexity of Graph Connectivity |
160
click to vote
SYNASC
2007
IEEE
16 years 27 days ago
2007
IEEE
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
161
click to vote
AMW
2010
15 years 8 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
182
click to vote
ISCC
1999
IEEE
15 years 11 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
168
click to vote
RR
2010
Springer
15 years 5 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
133
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...