2270 search results - page 128 / 454 » On the distribution of eigenvalues of graphs |
203
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
154
click to vote
FOCS
2008
IEEE
16 years 24 days ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
184
click to vote
IPPS
2008
IEEE
16 years 23 days ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
138
click to vote
SAC
2006
ACM
16 years 9 days ago
2006
ACM
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
202
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...