1162 search results - page 21 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
118
click to vote
CSB
2004
IEEE
15 years 7 months ago
2004
IEEE
Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First,...
144
click to vote
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
141
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
133
Voted
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...
121
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Identification of the structural domains of proteins is important for our understanding of the organizational principles and mechanisms of protein folding, and for ins...