13621 search results - page 147 / 2725 » Computability and Complexity in Self-assembly |
181
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
147
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
180
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...
163
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we present a versatile and robust model for geometrically complex deformable solids. Our approach can be applied to deformable tetrahedral meshes and to deformable ...
177
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...