13621 search results - page 243 / 2725 » Computability and Complexity in Self-assembly |
208
click to vote
ACRI
2010
Springer
15 years 5 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
196
click to vote
CIE
2007
Springer
16 years 24 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
177
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
167
click to vote
FOCS
2007
IEEE
16 years 29 days ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
191
click to vote
ECCV
1998
Springer
15 years 10 months ago
1998
Springer
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of e...