13621 search results - page 345 / 2725 » Computability and Complexity in Self-assembly |
213
click to vote
BMCBI
2010
2010
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
15 years 6 months ago
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
177
click to vote
ICALP
2007
Springer
16 years 28 days ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
150
Voted
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
183
click to vote
DCG
2010
15 years 4 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
207
click to vote
ECCC
2011
15 years 1 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...