3946 search results - page 88 / 790 » The computational complexity of choice sets |
172
click to vote
VIS
2009
IEEE
16 years 7 months ago
2009
IEEE
Time and streak surfaces are ideal tools to illustrate time-varying vector fields since they directly appeal to the intuition about coherently moving particles. However, efficient ...
169
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
202
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
149
click to vote
FPCA
1989
15 years 10 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
185
click to vote
HCI
2009
15 years 4 months ago
2009
This paper introduces our research which aims to develop a design approach for ADAS applications in which human factors (including stakeholder feedback and objective performance me...