1389 search results - page 145 / 278 » Improved Approximation Algorithms for Label Cover Problems |
128
click to vote
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
— Cellular simultaneous recurrent neural network has been suggested to be a function approximator more powerful than the MLP’s, in particular for solving approximate dynamic pr...
152
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
131
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
165
Voted
SEMCO
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we consider a sentiment regression problem: summarizing the overall sentiment of a review with a real-valued score. Empirical results on a set of labeled reviews sh...
141
click to vote
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...