1951 search results - page 228 / 391 » An algorithm for improving graph partitions |
194
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
189
Voted
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
163
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
154
click to vote
TCAD
2008
15 years 4 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
120
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...