560 search results - page 2 / 112 » Multiplication by a Constant is Sublinear |
DCC
2002
IEEE
14 years 6 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T...
CHI
2004
ACM
14 years 7 months ago
2004
ACM
Most current designs of information technology are based on the notion of supporting distinct tasks such as document production, email usage, and voice communication. In this pape...
CC
2008
Springer
13 years 7 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
ICALP
2005
Springer
14 years 17 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...