3852 search results - page 471 / 771 » Construction of Codes for Network Coding |
174
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
218
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
168
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
166
click to vote
DCC
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper investigates compression of encrypted data. It has been previously shown that data encrypted with Vernam’s scheme [1], also known as the one-time pad, can be compress...
195
click to vote
HICSS
2009
IEEE
16 years 1 months ago
2009
IEEE
The idea to develop applications and infrastructure software as software product lines (SPLs) is continuously growing in acceptance throughout the software industry. The ability t...