343 search results - page 21 / 69 » On Making Directed Graphs Transitive |
115
Voted
EACL
1989
ACL Anthology
15 years 3 months ago
1989
ACL Anthology
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...
123
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
121
Voted
MICCAI
2006
Springer
16 years 2 months ago
2006
Springer
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
125
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
116
click to vote
IPPS
2002
IEEE
15 years 6 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...