Sciweavers

689 search results - page 103 / 138
» Metrics for more than two points at once
Sort
View
IPPS
2008
IEEE
16 years 15 days ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
MJ
2007
119views more  MJ 2007»
15 years 5 months ago
Automated energy calculation and estimation for delay-insensitive digital circuits
With increasingly smaller feature sizes and higher on-chip densities, the power dissipation of VLSI systems has become a primary concern for designers. This paper first describes...
Venkat Satagopan, Bonita Bhaskaran, Anshul Singh, ...
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
16 years 6 days ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
ESAS
2004
Springer
15 years 11 months ago
Public Key Cryptography in Sensor Networks - Revisited
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
Gunnar Gaubatz, Jens-Peter Kaps, Berk Sunar
BMCBI
2007
124views more  BMCBI 2007»
15 years 6 months ago
A high-accuracy consensus map of yeast protein complexes reveals modular nature of gene essentiality
Background: Identifying all protein complexes in an organism is a major goal of systems biology. In the past 18 months, the results of two genome-scale tandem affinity purificatio...
G. Traver Hart, Insuk Lee, Edward M. Marcotte