179 search results - page 25 / 36 » The proof of Hermann's conjecture |
151
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
The inverse protein folding problem is that of designing an amino acid sequence which has a prescribed native protein fold. This problem arises in drug design where a particular st...
166
click to vote
DLT
2007
15 years 7 months ago
2007
d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...
158
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
142
click to vote
FOCS
2008
IEEE
16 years 15 days ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
176
click to vote
FOCS
2006
IEEE
16 years 3 days ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...