971 search results - page 59 / 195 » Comparative Analysis of Arithmetic Coding Computational Comp... |
110
click to vote
ICCAD
1994
IEEE
15 years 6 months ago
1994
IEEE
This work presents techniques for computing the switching activities of all circuit nodes under pseudorandom or biased input sequences and assuming a zero delay mode of operation....
118
click to vote
WSE
2002
IEEE
15 years 6 months ago
2002
IEEE
The World Wide Web, initially intended as a way to publish static hypertexts on the Internet, is moving toward complex applications. Static Web sites are being gradually replaced ...
121
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
ITICSE
2009
ACM
15 years 8 months ago
2009
ACM
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signiï¬...
136
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...