148 search results - page 19 / 30 » Optimizing random walk search algorithms in P2P networks |
SAC
2004
ACM
15 years 5 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
109
click to vote
NIPS
2004
15 years 1 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
IDEAL
2007
Springer
15 years 5 months ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
121
click to vote
TMC
2008
14 years 11 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
101
click to vote
MST
2010
14 years 6 months ago
2010
We consider the important problem of energy balanced data propagation in wireless sensor networks and we extend and generalize previous works by allowing adaptive energy assignment...