4894 search results - page 939 / 979 » The Guarding Problem - Complexity and Approximation |
109
Voted
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
121
Voted
MOBIHOC
2008
ACM
16 years 2 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...
164
Voted
SODA
2010
ACM
16 years 5 days 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 ...
171
Voted
ALT
2009
Springer
15 years 11 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...
133
Voted
ALT
2004
Springer
15 years 11 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...