1002 search results - page 10 / 201 » Towards Graph Programs for Graph Algorithms |
SBACPAD
2005
IEEE
15 years 3 months ago
2005
IEEE
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
EUROGP
2009
Springer
15 years 4 months ago
2009
Springer
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
77
Voted
NETWORKS
2006
14 years 9 months ago
2006
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...