9 search results - page 2 / 2 » An improved list decoding algorithm for the second order Ree... |
SIAMCOMP
2010
13 years 3 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
APLAS
2003
ACM
13 years 10 months ago
2003
ACM
This paper studies the problem of resource availability in the context of mobile code for embedded systems such as smart cards. It presents an architecture dedicated to controlling...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...