Zobrazeno 1 - 10
of 30
pro vyhledávání: '"A.C. Kam"'
Publikováno v:
IEEE Journal on Selected Areas in Communications. 19:2121-2130
This paper presents a new protocol for statistical multiplexing of bursty data traffic in the forward (base-to-mobile) link of a wireless wideband code division multiple access (W-CDMA) system using orthogonal variable spreading factor (OVSF) codes.
Autor:
Kai-Yeung Siu, A.C. Kam
Publikováno v:
IEEE Journal on Selected Areas in Communications. 18:2029-2040
This paper presents new research results of the DARPA-funded ONRAMP consortium on the next generation Internet to study efficient WDM-based network architectures and protocols for supporting broadband services in regional access networks. In particul
Autor:
Kai-Yeung Siu, A.C. Kam
Publikováno v:
IEEE Journal on Selected Areas in Communications. 17:1040-1056
We present several fast, practical linear-complexity scheduling algorithms that enable provision of various quality-of-service (QoS) guarantees in an input-queued switch with no speedup. Specifically, our algorithms provide per-virtual-circuit transm
Publikováno v:
Journal of Lightwave Technology. 16:2265-2280
This paper presents the design of a cell-switching wavelength division multiplexing (WDM) local area network (LAN), which constitutes a key component of a next-generation internet (NGI) consortium project recently funded by DARPA. An important goal o
Publikováno v:
IEEE Journal on Selected Areas in Communications. 16:1024-1039
Most existing wavelength-division multiplexed (WDM) networks employ circuit switching, typically with one session having exclusive use of one entire wavelength. Consequently, they are not suitable for data applications involving bursty traffic patter
Autor:
A.C. Kam, Gary E. Kopec
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 18:945-950
This correspondence describes an approach to reducing the computational cost of document image decoding by viewing it as a heuristic search problem. The kernel of the approach is a modified dynamic programming (DP) algorithm, called the iterated comp
Autor:
A.C. Kam, G.E. Kopec
Publikováno v:
ICASSP (5)
This paper describes an approach to reducing the computational cost of document image decoding using Markov source models. The kernel of the approach is a type of informed best-first search algorithm, called the iterated complete path (ICP) algorithm
Autor:
A.C. Kam, Kai-Yeung Siu
Publikováno v:
ICNP
We present several fast, practical linear-complexity scheduling algorithms that enable provision of various quality-of-service (QoS) guarantees in an input-queued switch with no speedup. Specifically, our algorithms provide per-virtual-circuit transm
Autor:
A.C. Kam, G.E. Kopec
Publikováno v:
Proceedings of 3rd International Conference on Document Analysis and Recognition.
The iterated complete path (ICP) algorithm is a heuristic search procedure for finding the best path through a weighted trellis. ICP is intended for problems in which the cost of computing the edge weights dominates the cost of finding the path given
Autor:
A.C. Kam, Kai-Yeung Siu
Publikováno v:
All-Optical Networking: Architecture, Control, and Management Issues.
Most existing or proposed WDM networks employ circuit switching, typically with one session having exclusive use of one entire wavelength. Consequently they are not suitable for data applications involving bursty traffic patterns. The MIT AON Consort