3373 search results - page 216 / 675 » Linear transformations on codes |
123
click to vote
CONCUR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
115
Voted
PKC
2010
Springer
15 years 5 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
ECCC
2007
15 years 3 months ago
2007
We give a self-contained exposition of selected results in additive combinatorics over the group GF(2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Bal...
156
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
129
click to vote
ICCAD
2003
IEEE
16 years 22 days ago
2003
IEEE
Optimizing array accesses is extremely critical in embedded computing as many embedded applications make use of arrays (in form of images, video frames, etc). Previous research co...