1671 search results - page 112 / 335 » Hierarchical graph maps |
ICCAD
2004
IEEE
14 years 7 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
VL
1998
IEEE
14 years 2 months ago
1998
IEEE
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
DCG
2008
13 years 10 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
GC
2010
Springer
13 years 8 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...