3946 search results - page 151 / 790 » The computational complexity of choice sets |
165
click to vote
IJHPCA
2006
15 years 6 months ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
155
click to vote
ICSE
2009
IEEE-ACM
16 years 1 months ago
2009
IEEE-ACM
Program analysis and automated test generation have primarily been used to find correctness bugs. We present complexity testing, a novel automated test generation technique to ...
154
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
177
click to vote
RECOMB
2006
Springer
16 years 6 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...
190
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...