1163 search results - page 120 / 233 » Embedding into Bipartite Graphs |
SIAMDM
2000
13 years 8 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
CSR
2008
Springer
13 years 10 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
PAMI
2007
13 years 7 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
EMSOFT
2011
Springer
12 years 8 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
DAC
1997
ACM
14 years 11 days ago
1997
ACM
: Hardware-software co-synthesis is the process of partitioning an embedded system specification into hardware and software modules to meet performance, power and cost goals. In t...