553 search results - page 38 / 111 » On Planar Path Transformation |
132
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
We propose a novel compression method for multiview still images. The algorithm exploits the layer-based representation, which partitions the data set into planar layers character...
144
click to vote
CONPAR
1992
15 years 8 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
142
click to vote
LCTRTS
2000
Springer
15 years 8 months ago
2000
Springer
This paper presents a general approach to automatically validate code-improving transformations on low-level program representations. The approach ensures the correctness of compi...
137
click to vote
JSA
2000
15 years 4 months ago
2000
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
142
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...