5153 search results - page 168 / 1031 » Introduction to Randomized Algorithms |
116
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
116
Voted
HASE
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we propose a randomization based technique to verify whether a manufactured chip conforms to its design or is infected by any trojan circuit. A trojan circuit can be...
156
click to vote
FOCM
2008
15 years 3 months ago
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
154
click to vote
ICDM
2009
IEEE
15 years 20 days 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...
144
click to vote
CVPR
2011
IEEE
14 years 11 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...