In this paper, we present an efficient fault-tolerant distributed location management protocol for personal communications service (PCS) networks.
1.1 Definition of the Problem This paper deals with the following combinatorial problem: given a graph G with costs on its edges, partition the nodes of G into subsets no larger than a given maximu
Maintaining per-flow information and state is a crucial topic in network monitoring. Tracking per-flow state is a relatively new area.
The viability of a low-cost real-time narrow-band voice coder with good speech quality will be demonstrated. We describe a hardware implementation of the U.S.
A linear-correction least-squares estimation procedure is proposed for the source localization problem under an additive measurement error model.
The method of linear prediction has proved quite popular and successful for use in speech compression systems.
We propose an enhancement that allows both short and long messages to be message authenticated more efficiently than HMAC while also providing proofs of security.
In this paper, we propose an efficient memory allocation scheme for memory-constrained Huffman coding of multiple sources, which can be applied to many adaptive variable-length coding systems.
This paper presents an efficient global routing technique for a custom integrated circuit (IC) containing tens of modules, where a module may be, e.g., a RAM, ROM, PLA, or block of polycells.
This paper deals with discrete cosine transform (DCT)-domain image resizing as compressed domain processing.
