787 search results - page 133 / 158 » Polynomial Constants are Decidable |
159
click to vote
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
195
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
133
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
135
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
138
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...