168 search results - page 7 / 34 » On Nontrivial Approximation of CSPs |
ICDT
2009
ACM
14 years 11 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
JMLR
2010
13 years 5 months ago
2010
In timbre remapping applications such as concatenative synthesis, an audio signal is used as a template, and a mapping process derives control data for some audio synthesis algori...
ESA
2003
Springer
14 years 3 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...