Sciweavers

659 search results - page 73 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
ICAC
2006
IEEE
14 years 1 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
ICS
1993
Tsinghua U.
13 years 11 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
14 years 7 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong
AOSD
2006
ACM
14 years 1 months ago
Towards supporting on-demand virtual remodularization using program graphs
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
David Shepherd, Lori L. Pollock, K. Vijay-Shanker
MM
2006
ACM
148views Multimedia» more  MM 2006»
14 years 1 months ago
Audio similarity measure by graph modeling and matching
This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to ...
Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Che...