560 search results - page 36 / 112 » Multiplication by a Constant is Sublinear |
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple des...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we propose a new resource allocation mechanism which is designed to improve the multiuser detection of wireless network diversity multiple access (NDMA) protocol...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
VLBV
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we compare temporal layered coding (TLC), as well as single-state coding (SSC), to multi-state video coding (MSVC) in the context of lossy video communications. MSV...