Sciweavers

3415 search results - page 378 / 683
» Lower bounds on kernelization
Sort
View
SPIRE
2010
Springer
15 years 5 months ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
TIP
2010
155views more  TIP 2010»
15 years 5 months ago
Is Denoising Dead?
—Image denoising has been a well studied problem in the field of image processing. Yet researchers continue to focus attention on it to better the current state-of-the-art. Rece...
Priyam Chatterjee, Peyman Milanfar
FOCS
2010
IEEE
15 years 4 months ago
The Limits of Two-Party Differential Privacy
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results ...
Andrew McGregor, Ilya Mironov, Toniann Pitassi, Om...
FSTTCS
2010
Springer
15 years 4 months ago
Generalized Mean-payoff and Energy Games
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
14 years 6 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett