96 search results - page 15 / 20 » Path Constraints in Semistructured Databases |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
157
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
HICSS
2003
IEEE
15 years 2 months ago
2003
IEEE
Our Distributed Telecommunication Management System (DTMS) uses an object-oriented model to describe the networked Voice Communication System (VCS) to be managed. In order to allo...
72
Voted
DOCENG
2009
ACM
15 years 4 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...