4894 search results - page 837 / 979 » The Guarding Problem - Complexity and Approximation |
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the obj...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
AIRS
2004
Springer
14 years 1 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
ARCS
2004
Springer
14 years 1 months ago
2004
Springer
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
CAAN
2004
Springer
14 years 1 months ago
2004
Springer
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...