98 search results - page 7 / 20 » Finding Regular Simple Paths in Graph Databases |
DEBU
2010
13 years 7 months ago
2010
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
JVCA
2007
13 years 7 months ago
2007
In this paper, we present an example-based motion synthesis technique. Users can interactively control the virtual character to perform desired actions in any order. The desired a...
DILS
2006
Springer
13 years 11 months ago
2006
Springer
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biol...
XSYM
2004
Springer
14 years 25 days 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...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...