2080 search results - page 110 / 416 » Measuring empirical computational complexity |
106
click to vote
PPSC
1997
15 years 5 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
161
click to vote
BMCBI
2010
2010
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
15 years 4 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...
133
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
182
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
166
click to vote
RTCSA
2003
IEEE
15 years 9 months ago
2003
IEEE
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by c...