Sciweavers

15033 search results - page 84 / 3007
» Complexity Theory and Algorithms
Sort
View
133
Voted
DLT
2004
15 years 5 months ago
Some New Directions and Questions in Parameterized Complexity
Recently there have been some new initiatives in the field of parameterized complexity. In this paper, we will report on some of these, concentrating on some open questions, and al...
Rodney G. Downey, Catherine McCartin
148
Voted
FOCS
2010
IEEE
15 years 1 months ago
The Complexity of Distributions
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
Emanuele Viola
131
Voted
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
SIAMCOMP
2012
13 years 6 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
115
Voted
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
16 years 3 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld