Sciweavers

6740 search results - page 177 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Probabilistic matching of line segments for their homography
Finding correspondences of two images taken from largely different camera configuration is a challenging problem because appearance information such as color, intensity and edge o...
Jihwan Woo, Taemin Kim, In-So Kweon
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
14 years 3 months ago
Parallel genetic algorithms on line topology of heterogeneous computing resources
This paper evaluates a parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of...
Yiyuan Gong, Morikazu Nakamura, Shiro Tamaki
ADG
2004
Springer
189views Mathematics» more  ADG 2004»
14 years 3 months ago
nD Polyhedral Scene Reconstruction from Single 2D Line Drawing by Local Propagation
In this paper, we study the problem of reconstructing the polyhedral structures and geometric positions of a general nD polyhedral scene from a single 2D line drawing. With the ide...
Hongbo Li
ICDAR
2003
IEEE
14 years 3 months ago
Correcting Document Image Warping Based on Regression of Curved Text Lines
Image warping is a common problem when one scans or photocopies a document page from a thick bound volume, resulting in shading and curved text lines in the spine area of the boun...
Zheng Zhang 0003, Chew Lim Tan
COMPGEOM
2010
ACM
14 years 3 months ago
Lines avoiding balls in three dimensions revisited
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
Natan Rubin