2060 search results - page 80 / 412 » Some Applications of Coding Theory in Computational Complexi... |
ACL
1994
14 years 11 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
TIT
2010
14 years 4 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
107
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
PPAM
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a case study of numerical simulations in an easy-to-use matrix computation framework named Simple Interface for Library Collections (SILC), which allows users t...