1060 search results - page 83 / 212 » Notes on Coding Theory |
168
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
140
click to vote
CHI
2010
ACM
16 years 1 months ago
2010
ACM
Developers, like all modern knowledge workers, are frequently interrupted and blocked in their tasks. In this paper we present a contextual inquiry into developers’ current stra...
135
click to vote
MSR
2006
ACM
16 years 4 days ago
2006
ACM
ArgoUML uses both CVS and Bugzilla to keep track of bugfixing activities since 1998. A common practice is to reference source code changes resolving a bug stored in Bugzilla by i...
134
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
An (n, m, k)-resilient function is a function f : Fn 2 → Fm 2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed ...
163
click to vote
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
With the advent of Java 5 annotations, we note a marked increase in the availability of tools that can statically detect potential null dereferences. For such tools to be truly eff...