1331 search results - page 158 / 267 » Complexity bounds for zero-test algorithms |
ISCAS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
TCS
2008
14 years 10 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
ESA
2007
Springer
15 years 4 months ago
2007
Springer
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
PODC
2010
ACM
14 years 10 months ago
2010
ACM
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
ECCV
2002
Springer
15 years 12 months ago
2002
Springer
This paper studies the inference of 3D shape from a set of ? noisy photos. We derive a probabilistic framework to specify what one can infer about 3D shape for arbitrarily-shaped, ...