Sciweavers

636 search results - page 40 / 128
» Computational Engineering and Science Program at the Univers...
Sort
View
COMPGEOM
1992
ACM
13 years 12 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
TCC
2009
Springer
112views Cryptology» more  TCC 2009»
14 years 8 months ago
Non-malleable Obfuscation
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...
Ran Canetti, Mayank Varia
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 11 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
TAPIA
2009
ACM
14 years 15 days ago
Research experiences for undergraduates: autonomic computing research at FIU
According to Computing Research Association, during each year between 2003 and 2007, fewer than 3% of the US’s Ph.D.s graduates in computer science and computer engineering were...
Masoud Milani, Seyed Masoud Sadjadi, Raju Rangaswa...
ICLP
1998
Springer
14 years 1 days ago
Program Specialisation and Abstract Interpretation Reconciled
Interpretation Reconciled Michael Leuschel1 Department of Computer Science, K.U. Leuven, Belgium DIKU, University of Copenhagen, Denmark fy the relationship between abstract inter...
Michael Leuschel