553 search results - page 21 / 111 » On Planar Path Transformation |
NETWORKS
2011
12 years 10 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Man-made real-world environments are dominated by planar surfaces many of which constitute behaviorrelevant entities. Thus, the ability to perceive planar surfaces is v...
ICIP
2002
IEEE
14 years 10 days ago
2002
IEEE
The topic of the paper is to estimate parameters of the camera motion using images taken at initial and current positions of the camera. An original method handling defocused imag...
ALGOSENSORS
2004
Springer
14 years 24 days ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
EURODAC
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper describes a method to optimize the performance of data paths. It is based on bit-level arithmetic transformations, and is especially suited to optimize large adder stru...