488 search results - page 73 / 98 » Automorphic Decompositions of Graphs |
157
click to vote
TIP
2010
15 years 1 months ago
2010
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
132
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
115
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
179
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
131
click to vote
FASE
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...