493 search results - page 21 / 99 » Graph Database Indexing Using Structured Graph Decomposition |
ACL
2009
13 years 5 months ago
2009
Past work on English coordination has focused on coordination scope disambiguation. In Japanese, detecting whether coordination exists in a sentence is also a problem, and the sta...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
DAM
1999
13 years 7 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
DBA
2004
13 years 9 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...