11345 search results - page 1651 / 2269 » Foundations of Computer Science |
157
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
166
click to vote
EACL
2009
ACL Anthology
16 years 7 months ago
2009
ACL Anthology
ion Benjamin Van Durme, Phillip Michalak and Lenhart K. Schubert Department of Computer Science University of Rochester Rochester, NY 14627, USA Existing work in the extraction of...
167
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...
168
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
179
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...