Sciweavers

2095 search results - page 355 / 419
» Improved pebbling bounds
Sort
View
BMCBI
2010
113views more  BMCBI 2010»
13 years 10 months ago
Prediction of FAD interacting residues in a protein from its primary sequence using evolutionary information
Background: Flavin binding proteins (FBP) plays a critical role in several biological functions such as electron transport system (ETS). These flavoproteins contain very tightly b...
Nitish K. Mishra, Gajendra P. S. Raghava
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 10 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 10 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 10 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 10 months ago
Finding cores of random 2-SAT formulae via Poisson cloning
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
Jeong Han Kim