20 search results - page 2 / 4 » Rectangle Covers Revisited Computationally |
ARITH
2003
IEEE
15 years 2 months ago
2003
IEEE
The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a r...
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
62
Voted
SGP
2007
14 years 12 months ago
2007
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
BMVC
2010
14 years 7 months ago
2010
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...