3008 search results - page 198 / 602 » Independence in connected graphs |
170
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
223
click to vote
CVPR
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
181
click to vote
JGAA
2006
15 years 6 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
143
click to vote
SIAMDM
1998
15 years 6 months ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
131
click to vote
CONNECTION
1998
15 years 6 months ago
1998
The evolution of language implies the parallel evolution of an ability to respond appropriately to signals (language understanding) and an ability to produce the appropriate signa...