343 search results - page 6 / 69 » On Making Directed Graphs Transitive |
96
Voted
AAAI
2008
15 years 1 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
96
Voted
ICPR
2004
IEEE
16 years 22 days ago
2004
IEEE
The reconstruction of objects from data in practical applications often leads to surfaces with small perturbations and other artifacts which make the detection of their ridges and...
99
Voted
ICCAD
1999
IEEE
15 years 3 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
104
click to vote
ER
2007
Springer
15 years 5 months ago
2007
Springer
During software requirements analysis and design steps, developers and stakeholders have many alternatives of artifacts such as software component selection and should make decisi...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...