260 search results - page 24 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
77
Voted
RECOMB
2005
Springer
16 years 2 days ago
2005
Springer
In the half-century since the C-value paradox (the apparent lack of correlation between organismal genome size and morphological complexity) was described, there have been no expli...
112
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
STOC
2002
ACM
16 years 1 days ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
EJC
2007
14 years 11 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
101
click to vote
SPRINGSIM
2010
14 years 10 months ago
2010
This paper presents a distributed Bayesian fault diagnosis scheme for physical systems. Our diagnoser design is based on a procedure for factoring the global system bond graph (BG...