Sciweavers

1127 search results - page 36 / 226
» New Algorithms for Generalized Network Flows
Sort
View
ICPP
2009
IEEE
15 years 4 months ago
Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
Karl Jiang, David Ediger, David A. Bader
WSCG
2003
167views more  WSCG 2003»
14 years 11 months ago
Vector-valued Image Restoration with Applications to Magnetic Resonance Velocity Imaging
The analysis of blood flow patterns and the interaction between salient topological flow features and cardiovascular structure plays an important role in the study of cardiovascul...
Yin-Heung Pauline Ng, Guang-Zhong Yang
ICDCSW
2005
IEEE
15 years 3 months ago
MAFIC: Adaptive Packet Dropping for Cutting Malicious Flows to Push Back DDoS Attacks
— In this paper, we propose a new approach called MAFIC (MAlicious Flow Identification and Cutoff) to support adaptive packet dropping to fend off DDoS attacks. MAFIC works by j...
Yu Chen, Yu-Kwong Kwok, Kai Hwang
INFOCOM
1999
IEEE
15 years 2 months ago
Inter-Class Resource Sharing using Statistical Service Envelopes
Networks that support multiple services through "link-sharing" must address the fundamental conflicting requirement between isolation among service classes to satisfy ea...
Jingyu Qiu, Edward W. Knightly
JAL
2006
101views more  JAL 2006»
14 years 10 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...