368 search results - page 72 / 74 » Higher Eigenvalues of Graphs |
SODA
1997
ACM
14 years 11 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
105
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
BMCBI
2007
14 years 9 months ago
2007
Background: The systematic analysis of protein-protein interactions can enable a better understanding of cellular organization, processes and functions. Functional modules can be ...
121
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
87
Voted
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
14 years 9 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...