2168 search results - page 113 / 434 » Randomized Algorithms and Complexity Theory |
124
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Cancer diagnosis and clinical outcome prediction are among the most important emerging applications of gene expression microarray technology with several molecular sig...
121
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
117
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
120
click to vote
CISS
2008
IEEE
15 years 9 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
140
click to vote
COMPLEX
2009
Springer
15 years 7 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...