Sciweavers

3415 search results - page 590 / 683
» Lower Bounds for Kernelizations
Sort
View
TCS
2002
13 years 9 months ago
Some permutation routing algorithms for low-dimensional hypercubes
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
Frank K. Hwang, Y. C. Yao, Bhaskar DasGupta
TCSV
2002
161views more  TCSV 2002»
13 years 9 months ago
Blocking artifact detection and reduction in compressed data
A novel frequency-domain technique for image blocking artifact detection and reduction is presented in this paper. The algorithm first detects the regions of the image which presen...
George A. Triantafyllidis, Dimitrios Tzovaras, Mic...
TELSYS
2002
122views more  TELSYS 2002»
13 years 9 months ago
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassemb...
George C. Lin, Tatsuya Suda, Fumio Ishizaki
TIT
2002
107views more  TIT 2002»
13 years 9 months ago
Constrained systems with unconstrained positions
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...
Jorge Campello de Souza, Brian H. Marcus, Richard ...
MONET
2007
111views more  MONET 2007»
13 years 9 months ago
Resource Discovery in Activity-Based Sensor Networks
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...
Doina Bucur, Jakob E. Bardram