29 search results - page 5 / 6 » Closing the Gap Between Runtime Complexity and Polytime Comp... |
TCSV
2010
14 years 4 months ago
2010
During the past ten years, Wyner-Ziv video coding (WZVC) has gained a lot of research interests because of its unique characteristics of "simple encoding, complex decoding&quo...
JACM
1998
14 years 9 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
BROADNETS
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Networked value constellations are collections of enterprises that jointly satify complex consumer needs. Increasingly, such needs are satisfied by e-services, i.e. commercial ser...