2957 search results - page 149 / 592 » The Complexity of Polynomial-Time Approximation |
166
click to vote
OPODIS
2010
15 years 2 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
142
click to vote
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
142
click to vote
RECOMB
2007
Springer
16 years 5 months ago
2007
Springer
Abstract. Given the substantial computational requirements of stochastic simulation, approximation is essential for efficient analysis of any realistic biochemical system. This pap...
242
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
133
click to vote
BC
2006
15 years 5 months ago
2006
The part of the primate visual cortex responsible for the recognition of objects is parcelled into about a dozen areas organized somewhat hierarchically (the region is called the v...