3875 search results - page 206 / 775 » Approximation algorithms for the 0-extension problem |
147
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
153
click to vote
CSDA
2010
15 years 6 months ago
2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
152
click to vote
NAACL
2010
15 years 4 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
174
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
255
Voted
Publication
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...