Sciweavers

3415 search results - page 336 / 683
» Lower bounds on kernelization
Sort
View
ECCC
2010
106views more  ECCC 2010»
15 years 5 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
INFOCOM
2010
IEEE
15 years 5 months ago
Collaborative Measurements of Upload Speeds in P2P Systems
—In this paper, we study the theory of collaborative upload bandwidth measurement in peer-to-peer environments. A host can use a bandwidth estimation probe to determine the bandw...
John R. Douceur, James W. Mickens, Thomas Moscibro...
WIOPT
2010
IEEE
15 years 5 months ago
Throughput-delay-reliability tradeoff in ad hoc networks
Abstract—Delay-reliability (D-R), and throughput-delayreliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repe...
Rahul Vaze
197
Voted
COLT
2010
Springer
15 years 4 months ago
Nonparametric Bandits with Covariates
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
Philippe Rigollet, Assaf Zeevi
323
Voted
PVLDB
2011
15 years 1 months ago
Personalized Social Recommendations - Accurate or Private?
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
Ashwin Machanavajjhala, Aleksandra Korolova, Atish...