402 search results - page 63 / 81 » Random Search for Hyper-Parameter Optimization |
149
Voted
TIT
2010
14 years 9 months ago
2010
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
186
Voted
PODC
2011
ACM
14 years 5 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
115
Voted
IACR
2011
14 years 2 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
152
Voted
JBI
2004
15 years 3 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
122
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...