Sciweavers

5100 search results - page 735 / 1020
» The Linear Complexity of a Graph
Sort
View
CIKM
2009
Springer
16 years 1 months ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun
RTSS
2007
IEEE
16 years 26 days ago
Integrating Adaptive Components: An Emerging Challenge in Performance-Adaptive Systems and a Server Farm Case-Study
The increased complexity of performance-sensitive software systems leads to increased use of automated adaptation policies in lieu of manual performance tuning. Composition of ada...
Jin Heo, Dan Henriksson, Xue Liu, Tarek F. Abdelza...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 22 days ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
COMSWARE
2006
IEEE
16 years 19 days ago
Resource management in heterogenous wireless networks with overlapping coverage
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
Bin Bin Chen, Mun Choon Chan
PODC
2006
ACM
16 years 16 days ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...