1439 search results - page 261 / 288 » Fast approximation of centrality |
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
113
Voted
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
126
Voted
MOBIHOC
2008
ACM
16 years 22 days ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
121
Voted
MOBIHOC
2007
ACM
16 years 22 days ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
107
Voted
MOBIHOC
2003
ACM
16 years 22 days ago
2003
ACM
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...