3405 search results - page 650 / 681 » Factoring Groups Efficiently |
132
Voted
RECOMB
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
146
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
129
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
142
click to vote
OSDI
2006
ACM
16 years 3 months ago
2006
ACM
Operating systems are complex and their behavior depends on many factors. Source code, if available, does not directly help one to understand the OS's behavior, as the behavi...
130
click to vote
OSDI
2002
ACM
16 years 3 months ago
2002
ACM
In this paper, we present techniques for provisioning CPU and network resources in shared hosting platforms running potentially antagonistic third-party applications. The primary ...