5595 search results - page 788 / 1119 » Approximation Algorithms for Clustering Problems |
197
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
192
click to vote
TC
1998
15 years 6 months ago
1998
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
171
click to vote
IACR
2011
14 years 6 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
175
click to vote
CIVR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper presents novel dissimilarity space specially designed for interactive multimedia retrieval. By providing queries made of positive and negative examples, the go...
148
click to vote
SOSP
1997
ACM
15 years 8 months ago
1997
ACM
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...