Sciweavers

123 search results - page 11 / 25
» Embedding of Hypercubes into Grids
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Self-Avoiding Walks over Adaptive Unstructured Grids
Abstract. In this paper, we present self-avoiding walks as a novel technique to linearize" a triangular mesh. Unlike space- lling curves which are based on a geometric embeddi...
Gerd Heber, Rupak Biswas, Guang R. Gao
CCCG
2007
13 years 9 months ago
On Bus Graph Realizability
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doy...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
IPPS
2006
IEEE
14 years 1 months ago
Topology-aware task mapping for reducing communication contention on large parallel machines
Communication latencies constitute a significant factor in the performance of parallel applications. With techniques such as wormhole routing, the variation in no-load latencies ...
T. Agarwal, Amit Sharma, A. Laxmikant, Laxmikant V...
EGC
2005
Springer
14 years 1 months ago
GLIDE: A Grid-Based Light-Weight Infrastructure for Data-Intensive Environments
Abstract. The promise of the grid is that it will enable public access and sharing of immense amounts of computational and data resources among dynamic coalitions of individuals an...
Chris Mattmann, Sam Malek, Nels Beckman, Marija Mi...