396 search results - page 38 / 80 » Crossing Numbers |
JGAA
2002
13 years 10 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...
LATA
2009
Springer
14 years 5 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...
ICIP
1994
IEEE
15 years 8 days 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...
TIP
2008
13 years 10 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...
IAJIT
2011
13 years 2 months ago
2011
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...