420 search results - page 68 / 84 » Search on High Degree Graphs |
118
Voted
CPC
1999
15 years 10 days ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
103
Voted
SIGSOFT
2008
ACM
16 years 1 months ago
2008
ACM
NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known ...
114
Voted
RECOMB
2003
Springer
16 years 1 months ago
2003
Springer
We develop a new framework for inferring models of transcriptional regulation. The models in this approach, which we call physical models, are constructed on the basis of verifiab...
126
Voted
MOBIHOC
2008
ACM
16 years 8 days ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
130
click to vote
ICPP
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...