409 search results - page 41 / 82 » Odd Crossing Number and Crossing Number Are Not the Same |
TIP
2008
13 years 7 months ago
2008
Abstract--Local learning methods, such as local linear regression and nearest neighbor classifiers, base estimates on nearby training samples, neighbors. Usually, the number of nei...
JGAA
2002
13 years 7 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
ICIP
1994
IEEE
14 years 9 months ago
1994
IEEE
The development of a system able to detect and track moving people is described. Given a sequence of timevarying images, the goal is to count the number of people crossing a count...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
GD
2005
Springer
14 years 1 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....