1986 search results - page 276 / 398 » Path Separability of Graphs |
112
click to vote
IJFCS
1998
15 years 2 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
122
click to vote
TIP
1998
15 years 2 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
110
click to vote
OTM
2010
Springer
15 years 13 days ago
2010
Springer
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
150
Voted
TIT
2010
14 years 9 months ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
142
Voted
ISBI
2011
IEEE
14 years 6 months ago
2011
IEEE
High angular resolution diffusion imaging (HARDI) allows in vivo analysis of the white matter structure and connectivity. Based on orientation distribution functions (ODFs) that r...