38 search results - page 6 / 8 » Computing the Permanent of (Some) Complex Matrices |
TKDE
2012
11 years 8 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
IPPS
1998
IEEE
13 years 10 months ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
BMCBI
2007
13 years 5 months ago
2007
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
COMBINATORICS
2007
13 years 5 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
NIPS
2007
13 years 7 months ago
2007
We construct a biologically motivated stochastic differential model of the neural and hemodynamic activity underlying the observed Blood Oxygen Level Dependent (BOLD) signal in Fu...