1279 search results - page 205 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
STOC
1994
ACM
14 years 27 days ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
CAGD
2005
13 years 8 months ago
2005
This paper addresses the point-wise estimation of differential properties of a smooth manifold S--a curve in the plane or a surface in 3D--assuming a point cloud sampled over S is...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...