126 search results - page 14 / 26 » Improved Approximation of Linear Threshold Functions |
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
SARA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
COLT
2003
Springer
14 years 3 months ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...