Sciweavers

986 search results - page 82 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
129
Voted
JMMA
2010
90views more  JMMA 2010»
14 years 10 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
ICTCS
2005
Springer
15 years 9 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
123
Voted
SIGECOM
2004
ACM
105views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
Mechanism design for online real-time scheduling
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
Ryan Porter
113
Voted
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 3 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
COLT
2010
Springer
15 years 28 days 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