13603 search results - page 182 / 2721 » On the Complexity of Computing Treelength |
138
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
115
click to vote
COMPLEX
2009
Springer
15 years 11 months ago
2009
Springer
Security vendors are facing a serious problem of defeating the complexity of malwares. With the popularity and the variety of zeroday malware over the Internet, generating their si...
118
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Equalization techniques for room impulse responses (RIRs) are important in acoustic signal processing applications such as speech dereverberation. In practice, only approximate es...
262
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute s...
115
click to vote
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...