2080 search results - page 39 / 416 » Measuring empirical computational complexity |
RECOMB
2003
Springer
14 years 10 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
EMNLP
2008
13 years 11 months ago
2008
Knowing the degree of antonymy between words has widespread applications in natural language processing. Manually-created lexicons have limited coverage and do not include most se...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
KBSE
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—Test coverage such as branch coverage is commonly measured to assess the sufficiency of test inputs. To reduce tedious manual efforts in generating high-covering test i...
COMCOM
2011
13 years 4 months ago
2011
In the very active field of complex networks, research advances have largely been stimulated by the availability of empirical data and the increase in computational power needed ...