Sciweavers

245 search results - page 25 / 49
» Effect of node size on the performance of cache-conscious B ...
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
INFOCOM
2007
IEEE
14 years 1 months ago
Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree
— The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interc...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
ICCD
2005
IEEE
111views Hardware» more  ICCD 2005»
14 years 4 months ago
Supply Voltage Degradation Aware Analytical Placement
Increasingly significant power/ground supply voltage degradation in nanometer VLSI designs leads to system performance degradation and even malfunction. Existing techniques focus...
Andrew B. Kahng, Bao Liu, Qinke Wang
CCGRID
2008
IEEE
14 years 2 months ago
A Technique for Lock-Less Mirroring in Parallel File Systems
—As parallel file systems span larger and larger numbers of nodes in order to provide the performance and scalability necessary for modern cluster applications, the need for fau...
Bradley W. Settlemyer, Walter B. Ligon III
TON
2008
109views more  TON 2008»
13 years 7 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta