98 search results - page 17 / 20 » Finding Regular Simple Paths in Graph Databases |
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
A practical lipreading system can be considered either as subject dependent (SD) or subject-independent (SI). An SD system is user-specific, i.e., customized for some particular ...
SIROCCO
2010
13 years 9 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
The instabilities of the medial axis of a shape under deformations have long been recognized as a major obstacle to its use in recognition and other applications. These instabilit...