1389 search results - page 156 / 278 » Improved Approximation Algorithms for Label Cover Problems |
137
click to vote
ESANN
2001
15 years 4 months ago
2001
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
130
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
106
click to vote
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
142
click to vote
SPAA
1993
ACM
15 years 7 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
125
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...