356 search results - page 38 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
182
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
175
Voted
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
183
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
166
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
176
Voted
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...