53 search results - page 4 / 11 » Can Visibility Graphs be Represented Compactly |
GD
1997
Springer
13 years 11 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
ICSE
2004
IEEE-ACM
14 years 7 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
ISMAR
2007
IEEE
14 years 1 months ago
2007
IEEE
We present an efficient and accurate object tracking algorithm based on the concept of graph cut segmentation. The ability to track visible objects in real-time provides an inval...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...