276 search results - page 38 / 56 » Lower bounds for the complexity of linear functionals in the... |
ECCC
2010
13 years 7 months ago
2010
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
ROBOCOMM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper a new class of invertible watermarking approach based on quantization has been introduced. Based on the necessary conditions (blindness, reversibility and impercepti...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...