4843 search results - page 929 / 969 » The Shortcut Problem - Complexity and Approximation |
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
115
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
123
click to vote
ALT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
ALT
2004
Springer
15 years 6 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
SOSP
2003
ACM
15 years 6 months ago
2003
ACM
Diagnosing faults in the Internet is arduous and time-consuming, in part because the network is composed of diverse components spread across many administrative domains. We consid...