336 search results - page 30 / 68 » Effective Randomness for Computable Probability Measures |
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
MMM
2007
Springer
14 years 1 months ago
2007
Springer
This study developed a new shape-based 3D model descriptor based on the D2 shape descriptor developed by Osada, et al of Princeton University. Shape descriptors can be used to meas...
JCST
2010
13 years 2 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
BMCBI
2008
13 years 7 months ago
2008
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...