Sciweavers

1439 search results - page 6 / 288
» Fast approximation of centrality
Sort
View
ICPP
2006
IEEE
14 years 4 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
DATE
2002
IEEE
102views Hardware» more  DATE 2002»
14 years 3 months ago
Library Compatible Ceff for Gate-Level Timing
Accurate gate-level static timing analysis in the presence of RC loads has become an important problem for modern deep-submicron designs. Non-capacitive loads are usually analyzed...
Bernard N. Sheehan
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
14 years 2 months ago
Reporting Flock Patterns
Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data...
Marc Benkert, Joachim Gudmundsson, Florian Hü...
MONET
2008
135views more  MONET 2008»
13 years 10 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
ICIP
1999
IEEE
15 years 13 days ago
The Sinc-Approximating Kernels of Classical Polynomial Interpolation
A classical approach to interpolation of sampled data is polynomial interpolation. However, from the sampling theorem it follows that the ideal approach to interpolation is to con...
Erik H. W. Meijering, Wiro J. Niessen, Max A. Vier...