778 search results - page 85 / 156 » Expressiveness and complexity of graph logic |
XSYM
2004
Springer
15 years 5 months ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
CSL
2004
Springer
15 years 5 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
105
click to vote
INTERSENSE
2006
ACM
15 years 6 months ago
2006
ACM
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
103
Voted
MOZ
2004
Springer
15 years 5 months ago
2004
Springer
Strasheela provides a means for the composer to create a symbolic score by formally describing it in a rule-based way. The environment defines a rich music representation for comp...
143
click to vote
BMCBI
2011
14 years 7 months ago
2011
Background: The Cell Ontology (CL) is an ontology for the representation of in vivo cell types. As biological ontologies such as the CL grow in complexity, they become increasingl...