63 search results - page 5 / 13 » Lower Bounds for Reducibility to the Kolmogorov Random Strin... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
ESA
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
MASCOTS
2007
13 years 8 months ago
2007
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
TMC
2011
13 years 2 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...