Sciweavers

736 search results - page 13 / 148
» Approximating the Number of Network Motifs
Sort
View
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 1 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
DSN
2009
IEEE
14 years 2 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni
ALGOSENSORS
2009
Springer
14 years 2 months ago
Approximating Barrier Resilience in Wireless Sensor Networks
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...
Sergey Bereg, David G. Kirkpatrick
BMCBI
2006
133views more  BMCBI 2006»
13 years 7 months ago
Choosing negative examples for the prediction of protein-protein interactions
The protein-protein interaction networks of even well-studied model organisms are sketchy at best, highlighting the continued need for computational methods to help direct experim...
Asa Ben-Hur, William Stafford Noble
ICCAD
2009
IEEE
136views Hardware» more  ICCAD 2009»
13 years 5 months ago
A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...