4377 search results - page 195 / 876 » Mass problems and randomness |
197
click to vote
COMGEO
1999
ACM
15 years 6 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
183
click to vote
SPIN
2010
Springer
15 years 5 months ago
2010
Springer
Concolic testing is a method for test input generation where a given program is executed both concretely and symbolically at the same time. This paper introduces the LIME Concolic ...
197
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
172
click to vote
COMBINATORICA
2010
15 years 4 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
202
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
In this paper, we study the problem of fine-grained image categorization. The goal of our method is to explore fine image statistics and identify the discriminative image patche...