13621 search results - page 422 / 2725 » Computability and Complexity in Self-assembly |
168
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. ...
177
click to vote
CSCW
2004
ACM
16 years 9 days ago
2004
ACM
Computer system administrators are the unsung heroes of the information age, working behind the scenes to configure, maintain, and troubleshoot the computer infrastructure that un...
184
click to vote
DAM
2007
15 years 6 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
199
click to vote
CRYPTO
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
285
click to vote
ICS
2007
Tsinghua U.
16 years 1 months ago
2007
Tsinghua U.
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...