848 search results - page 17 / 170 » Randomness and the linear degrees of computability |
92
Voted
BMCBI
2010
14 years 12 months ago
2010
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
111
click to vote
BMCBI
2005
14 years 11 months ago
2005
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
101
click to vote
DCC
2005
IEEE
15 years 1 months ago
2005
IEEE
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
CSR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
100
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...