2489 search results - page 196 / 498 » On the Subgroup Distance Problem |
153
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
116
click to vote
ACCV
2010
Springer
14 years 11 months ago
2010
Springer
Estimating the atmospheric or meteorological visibility distance is very important for air and ground transport safety, as well as for air quality. However, there is no holistic ap...
154
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
143
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that "similar" points in input space are mapped to ne...
140
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Although camera self-calibration and metric reconstruction have been extensively studied during the past decades, automatic metric reconstruction from long video sequences with va...