136 search results - page 14 / 28 » Graph Nodes Clustering Based on the Commute-Time Kernel |
EUROPAR
2003
Springer
15 years 2 months ago
2003
Springer
Cluster applications that process large amounts of data, such as parallel scientific or multimedia applications, are likely to cause swapping on individual cluster nodes. These ap...
CLUSTER
2004
IEEE
15 years 1 months ago
2004
IEEE
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
GD
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
72
Voted
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
DICS
2006
15 years 1 months ago
2006
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...