493 search results - page 63 / 99 » Graph Database Indexing Using Structured Graph Decomposition |
ARSCOM
2007
13 years 7 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
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...
FLAIRS
2010
13 years 10 months ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...