4263 search results - page 750 / 853 » Learning without Coding |
232
click to vote
POPL
2003
ACM
16 years 1 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
113
click to vote
RECOMB
2003
Springer
16 years 1 months ago
2003
Springer
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
110
click to vote
CADE
2001
Springer
16 years 1 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
102
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
108
click to vote
OSDI
2004
ACM
16 years 1 months ago
2004
ACM
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...