3204 search results - page 235 / 641 » The Alcuin Number of a Graph |
157
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
169
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
134
click to vote
DIAGRAMS
2004
Springer
16 years 6 hour ago
2004
Springer
People sometimes appear to build analogical representations in order to reason about graphical information. In this paper we consider the extent to which the tendency to represent ...
219
Voted
ISPAN
2002
IEEE
15 years 11 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
183
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...