1986 search results - page 251 / 398 » Path Separability of Graphs |
201
click to vote
BDA
2004
15 years 7 months ago
2004
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
156
click to vote
EUROPDS
1997
15 years 7 months ago
1997
In this paper, we follow a new path to arrive at the idea of a COMA — a Cache Only Memory Architecture. We show how the evolution of another architecture (ADARC) leads quite nat...
183
click to vote
DAGSTUHL
1990
15 years 7 months ago
1990
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
167
click to vote
NOSSDAV
2001
Springer
15 years 10 months ago
2001
Springer
Recent advancements in video and audio codec technologies (e.g., RealVideo [18]) make multimedia streaming possible across a wide range of network conditions. With an increasing t...
159
click to vote
SIROCCO
2010
15 years 7 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 ...