343 search results - page 31 / 69 » On Making Directed Graphs Transitive |
118
Voted
SEFM
2003
IEEE
15 years 7 months ago
2003
IEEE
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
112
click to vote
HPDC
2006
IEEE
15 years 8 months ago
2006
IEEE
High performance application development remains challenging, particularly for scientists making the transition to a Grid environment. In general areas of computing, virtual envir...
117
click to vote
JCNS
2007
15 years 1 months ago
2007
Neuronal synchronization is often associated with small time delays, and these delays can change as a function of stimulus properties. Investigation of time delays can be cumbersom...
129
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
105
click to vote
IC
2003
15 years 3 months ago
2003
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...