200 search results - page 27 / 40 » What Graphs can be Efficiently Represented by BDDs |
SEMWEB
2004
Springer
14 years 26 days ago
2004
Springer
The Semantic Web is bound to be untrustworthy and inconsistent. In this paper, we present an initial approach for obtaining useful information in such an environment. In particular...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
LREC
2008
13 years 9 months ago
2008
Data models and encoding formats for syntactically annotated text corpora need to deal with syntactic ambiguity; underspecified representations are particularly well suited for th...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...