1060 search results - page 165 / 212 » Notes on Coding Theory |
171
click to vote
OOPSLA
2005
Springer
15 years 11 months ago
2005
Springer
Designing component-based application that meets performance requirements remains a challenging problem, and usually requires a prototype to be constructed to benchmark performanc...
166
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
168
click to vote
LCTRTS
2010
Springer
15 years 10 months ago
2010
Springer
Continuous technology scaling has brought us to a point, where transistors have become extremely susceptible to cosmic radiation strikes, or soft errors. Inside the processor, cac...
167
click to vote
PEPM
2009
ACM
15 years 10 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
214
click to vote
DIALM
2007
ACM
15 years 10 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...