1951 search results - page 156 / 391 » An algorithm for improving graph partitions |
167
click to vote
TCAD
2002
15 years 4 months ago
2002
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
145
click to vote
ESCAPE
2007
Springer
15 years 8 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
137
click to vote
APBC
2004
15 years 6 months ago
2004
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
136
click to vote
GC
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
153
Voted
AAAI
2008
15 years 7 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...