Sciweavers

8196 search results - page 222 / 1640
» Computational Modeling and Complexity Science
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
16 years 1 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
CSB
2005
IEEE
126views Bioinformatics» more  CSB 2005»
16 years 4 days ago
Discover True Association Rates in Multi-protein Complex Proteomics Data Sets
Experimental processes to collect and process proteomics data are increasingly complex, while the computational methods to assess the quality and significance of these data remain...
Changyu Shen, Lang Li, Jake Yue Chen
ICC
2009
IEEE
190views Communications» more  ICC 2009»
16 years 1 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
ICC
2007
IEEE
16 years 25 days ago
A Statistical Bit Error Generator for Emulation of Complex Forward Error Correction Schemes
— Forward Error Correction (FEC) schemes are generally used in wireless communication systems to maintain an acceptable quality of service. Various models have been proposed in l...
Reuben A. Farrugia, Carl James Debono
CIE
2006
Springer
15 years 10 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek