1736 search results - page 70 / 348 » The rank-width of Directed Graphs |
128
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
136
click to vote
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
128
Voted
ASPDAC
2000
ACM
15 years 8 months ago
2000
ACM
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
169
click to vote
PEPM
1997
ACM
15 years 8 months ago
1997
ACM
We present the design of a dynamic compilation system for C. Directed by a few declarative user annotations specifying where and on what dynamic compilation is to take place, a bi...
125
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
This article describes an exclusively resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. Our annotator is designed to p...