5316 search results - page 198 / 1064 » Which Search Problems Are Random |
164
click to vote
FOCM
2008
15 years 4 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...
161
click to vote
ICDM
2009
IEEE
15 years 1 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...
127
click to vote
COMBINATORICA
2010
15 years 1 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...
286
click to vote
CVPR
2011
IEEE
15 years 23 hour ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
149
Voted
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...