Sciweavers

29908 search results - page 460 / 5982
» On the Complexity of
Sort
View
MOBICOM
2006
ACM
16 years 1 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
PODC
2006
ACM
16 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
ISCAS
2005
IEEE
209views Hardware» more  ISCAS 2005»
16 years 19 days ago
Low complexity H.263 to H.264 video transcoding using motion vector decomposition
The H.264 adopts various block types and multiple reference frames for motion compensation. For transcoding a video sequence from the H.263 format to the H.264 format, it is benef...
Kai-Tat Fung, Wan-Chi Siu
QSHINE
2005
IEEE
16 years 19 days ago
Adaptive Low-Complexity Erasure-Correcting Code-Based Protocols for QoS-Driven Mobile Multicast Services
—We propose an adaptive hybrid automatic repeat request–forward error correction (ARQ–FEC) erasure-correcting scheme for quality of service (QoS)-driven mobile multicast serv...
Qinghe Du, Xi Zhang
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
16 years 18 days ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner