Sciweavers

557 search results - page 33 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
ICALP
2009
Springer
15 years 11 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
NN
2006
Springer
104views Neural Networks» more  NN 2006»
14 years 11 months ago
Local multidimensional scaling
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
Jarkko Venna, Samuel Kaski
91
Voted
PLDI
2003
ACM
15 years 4 months ago
Region-based hierarchical operation partitioning for multicluster processors
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
Michael L. Chu, Kevin Fan, Scott A. Mahlke
APPML
2005
68views more  APPML 2005»
14 years 11 months ago
A note on edge fault tolerance with respect to hypercubes
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn, matrices for generating linear k-EFT(Qn) graphs were used. Let EFTL(n, k) denote the set of matric...
Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 2 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre