1439 search results - page 211 / 288 » Fast approximation of centrality |
234
Voted
SISAP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
133
Voted
PODS
2012
ACM
13 years 3 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
149
click to vote
JMLR
2012
13 years 3 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
127
Voted
MOBIHOC
2008
ACM
16 years 9 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...
97
Voted
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
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...