200 search results - page 16 / 40 » What Graphs can be Efficiently Represented by BDDs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
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 ...
IJCAI
1989
13 years 8 months ago
1989
Solving design and analysis problems in physical worlds requires the representatio n of large amounts of knowledge. Recently, there has been much interest in explicitly making ass...
BIBM
2009
IEEE
14 years 2 months ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
SPE
2008
13 years 7 months ago
2008
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...