721 search results - page 39 / 145 » Graphs with Large Obstacle Numbers |
ICPR
2002
IEEE
14 years 2 months ago
2002
IEEE
This work reports experiments with four hierarchical clustering algorithms and two clustering indices for online handwritten characters. The main motivation of the work is to deve...
VIZSEC
2005
Springer
14 years 2 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
JCT
2008
13 years 9 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
GBRPR
2007
Springer
14 years 3 months ago
2007
Springer
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hiera...
PPOPP
2006
ACM
14 years 3 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...