478 search results - page 13 / 96 » Improving probability bounds by optimization over subsets |
170
click to vote
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
144
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
129
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
123
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a novel feature extraction method for face recognition. This method is based on Discrete Cosine Transform (DCT), Energy Probability (EP), and Linear Disc...
148
click to vote
NIPS
2004
15 years 5 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...