492 search results - page 12 / 99 » The number of possibilities for random dating |
CMSB
2006
Springer
14 years 9 days ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
Speech can be represented as a time/frequency distribution of energy using a multi-band filter bank. A Markov random field model, which takes into account the possible time asynch...
CSDA
2008
13 years 8 months ago
2008
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
MST
2000
13 years 8 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
ITIIS
2010
13 years 7 months ago
2010
There is a well-defined propagation model, named the random constant spread (RCS) model, which explains worms that spread their clones with a random scanning strategy. This model ...