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...
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 ...
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...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...
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...
Jean Choi, Yun-Su Chung, Ki-Hyun Kim, Jang-Hee Yoo
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...