160 search results - page 6 / 32 » On Planar Supports for Hypergraphs |
JMIV
2006
14 years 9 months ago
2006
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
83
Voted
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
60
Voted
ICRA
1998
IEEE
15 years 1 months ago
1998
IEEE
Bipedal robots are di cult to analyze mathematically. However, successful control strategies can be discovered using simple physical intuition and can be described in simple terms...
BMCBI
2011
14 years 4 months ago
2011
Background: Standard graphs, where each edge links two nodes, have been extensively used to represent the connectivity of metabolic networks. It is based on this representation th...
78
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...