Sciweavers

13621 search results - page 16 / 2725
» Computability and Complexity in Self-assembly
Sort
View
RTA
2010
Springer
14 years 1 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
CGI
1998
IEEE
14 years 2 months ago
Memory Management Schemes for Radiosity Computation in Complex Environments
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not f...
Daniel Meneveaux, Kadi Bouatouch, Eric Maisel
ICCS
2004
Springer
14 years 3 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
MFCS
2007
Springer
14 years 4 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
ACL
2010
13 years 7 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz