Sciweavers

1095 search results - page 167 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
127
Voted
IEEEPACT
2008
IEEE
15 years 8 months ago
Exploiting loop-dependent stream reuse for stream processors
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
Xuejun Yang, Ying Zhang, Jingling Xue, Ian Rogers,...
CVGIP
2004
169views more  CVGIP 2004»
15 years 2 months ago
Contour interpolation by straight skeletons
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) ...
Gill Barequet, Michael T. Goodrich, Aya Levi-Stein...
BMCBI
2010
178views more  BMCBI 2010»
15 years 2 months ago
An improved method for scoring protein-protein interactions using semantic similarity within the Gene Ontology
Background: Semantic similarity measures are useful to assess the physiological relevance of protein-protein interactions (PPIs). They quantify similarity between proteins based o...
Shobhit Jain, Gary D. Bader
DAC
2008
ACM
15 years 4 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...
PODC
2004
ACM
15 years 7 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku