4377 search results - page 504 / 876 » Mass problems and randomness |
214
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
242
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
211
click to vote
JMLR
2012
13 years 9 months ago
2012
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
189
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
176
click to vote
TCC
2007
Springer
16 years 28 days ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...