Sciweavers

1784 search results - page 66 / 357
» A Structural Analysis of Network Delay
Sort
View
IAT
2008
IEEE
14 years 3 months ago
Understanding Social Networks Using Formal Concept Analysis
Social networks are very popular nowadays and the understanding of their inner structure seems to be promising area. Several approaches for the social network structure visualizat...
Václav Snásel, Zdenek Horak, Ajith A...
CC
2007
Springer
208views System Software» more  CC 2007»
14 years 3 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
SPAA
1996
ACM
14 years 1 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
INFOCOM
1993
IEEE
14 years 1 months ago
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
Abhay K. Parekh, Robert G. Gallager
CVIU
2006
158views more  CVIU 2006»
13 years 9 months ago
Sequential mean field variational analysis of structured deformable shapes
A novel approach is proposed to analyzing and tracking the motion of structured deformable shapes, which consist of multiple correlated deformable subparts. Since this problem is ...
Gang Hua, Ying Wu