default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKai-Yeung Siu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j39]Ching Law, Amar K. Mehta, Kai-Yeung Siu:
A New Bluetooth Scatternet Formation Protocol. Mob. Networks Appl. 8(5): 485-498 (2003)- [j38]Mingxi Fan, Ceilidh Hoffmann, Kai-Yeung Siu:
Error-rate analysis for multirate DS-CDMA transmission schemes. IEEE Trans. Commun. 51(11): 1897-1909 (2003) - [j37]Kayi Lee, Kai-Yeung Siu:
On the reconfigurability of single-hub WDM ring networks. IEEE/ACM Trans. Netw. 11(2): 273-284 (2003) - [j36]Saad Mneimneh, Kai-Yeung Siu:
On achieving throughput in an input-queued switch. IEEE/ACM Trans. Netw. 11(5): 858-867 (2003) - [c32]Ching Law, Kai-Yeung Siu:
Distributed Construction of Random Expander Networks. INFOCOM 2003: 2133-2143 - 2002
- [j35]Mingxi Fan, Kai-Yeung Siu:
A dual-mode multiuser detector for DS-CDMA systems. IEEE J. Sel. Areas Commun. 20(2): 303-309 (2002) - [j34]Saad Mneimneh, Vishal Sharma, Kai-Yeung Siu:
Switching using parallel input-output queued switches with no speedup. IEEE/ACM Trans. Netw. 10(5): 653-665 (2002) - [c31]Sasdeddine S. Mneimneh, Kai-Yeung Siu:
Scheduling unsplittable flows using parallel switches. ICC 2002: 2410-2415 - 2001
- [j33]Anthony C. Kam, Thit Minn, Kai-Yeung Siu:
Supporting rate guarantee and fair access for bursty data traffic in W-CDMA. IEEE J. Sel. Areas Commun. 19(11): 2121-2130 (2001) - [j32]Paolo Narváez, Kai-Yeung Siu, Hong-Yi Tzeng:
New dynamic SPT algorithm based on a ball-and-string model. IEEE/ACM Trans. Netw. 9(6): 706-718 (2001) - [c30]Ching Law, Kai-Yeung Siu:
A Bluetooth scatternet formation algorithm. GLOBECOM 2001: 2864-2869 - [c29]Richard Rabbat, Kai-Yeung Siu:
Restoration methods for traffic engineered networks with loop-free routing guarantees. ICC 2001: 1566-1570 - [c28]Ching Law, Amar K. Mehta, Kai-Yeung Siu:
Performance of a new Bluetooth scatternet formation protocol. MobiHoc 2001: 183-192 - [c27]Mingxi Fan, Thit Minn, Kai-Yeung Siu:
Performance of multirate techniques in W-CDMA. VTC Fall 2001: 2262-2266 - 2000
- [j31]Thit Minn, Kai-Yeung Siu:
Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA. IEEE J. Sel. Areas Commun. 18(8): 1429-1440 (2000) - [j30]Anthony C. Kam, Kai-Yeung Siu:
Supporting bursty traffic with bandwidth guarantee in WDM distribution networks. IEEE J. Sel. Areas Commun. 18(10): 2029-2040 (2000) - [j29]Ching Law, Kai-Yeung Siu:
Online routing and wavelength assignment in single-hub WDM rings. IEEE J. Sel. Areas Commun. 18(10): 2111-2122 (2000) - [j28]Paolo Narváez, Kai-Yeung Siu, Hong-Yi Tzeng:
New dynamic algorithms for shortest path tree computation. IEEE/ACM Trans. Netw. 8(6): 734-746 (2000) - [c26]Ching Law, Kayi Lee, Kai-Yeung Siu:
Efficient memoryless protocol for tag identification. DIAL-M 2000: 75-84 - [c25]David Lecumberri, Kai-Yeung Siu, Paolo Narváez:
TCP performance improvement over high-speed flow switching networks. GLOBECOM 2000: 679-683 - [c24]Mingxi Fan, Thit Minn, Kai-Yeung Siu:
Improving the performance of linear MMSE detectors in multi-cell DS-CDMA system. PIMRC 2000: 524-528
1990 – 1999
- 1999
- [j27]Richard Rabbat, Kai-Yeung Siu:
QoS support for integrated services over CATV. IEEE Commun. Mag. 37(1): 64-68 (1999) - [j26]Wenge Ren, Kai-Yeung Siu, Hiroshi Suzuki:
Excess buffer requirement for EPD schemes in ATM networks. Comput. Commun. 22(15-16): 1367-1381 (1999) - [j25]Anthony C. Kam, Kai-Yeung Siu:
Linear-complexity algorithms for QoS support in input-queued switches with no speedup. IEEE J. Sel. Areas Commun. 17(6): 1040-1056 (1999) - [c23]Richard Rabbat, Kai-Yeung Siu, Nail Akar
:
Supporting differentiated services using ATM ABR service. ICCCN 1999: 210-213 - [c22]Paolo Narváez, Kai-Yeung Siu, Hong-Yi Tzeng:
Local restoration algorithm for link-state routing protocols. ICCCN 1999: 352-357 - [c21]Craig Barrack, Kai-Yeung Siu:
A Distributed Scheduling Algorithm for Quality of Service Support in Multiaccess Networks. ICNP 1999: 245-253 - [c20]Paolo Narváez, Kai-Yeung Siu, Hong-Yi Tzeng:
New Dynamic SPT Algorithm Based on a Ball-and-String Model. INFOCOM 1999: 973-981 - [c19]Cem Erin, H. Harry Asada, Kai-Yeung Siu:
Minimum energy coding for RF transmission. WCNC 1999: 621-625 - 1998
- [j24]Paolo Narváez, Kai-Yeung Siu:
Acknowledgment Bucket Scheme for Regulating TCP Flow over ATM. Comput. Networks 30(19): 1775-1791 (1998) - [j23]Wenge Ren, Kai-Yeung Siu, Hiroshi Suzuki, Masayuki Shinohara:
Meltipoint-to-Multipoint ABR Service in ATM. Comput. Networks 30(19): 1793-1810 (1998) - [j22]Hong-Yi Tzeng, Kai-Yeung Siu:
Performance of TCP over UBR in ATM with EPD and virtual queuing techniques. Comput. Commun. 21(12): 1070-1079 (1998) - [j21]Wenge Ren, Kai-Yeung Siu, Hiroshi Suzuki, Gopalakrishnan Ramamurthy:
Performance of TCP in IP/ATM internetworks. Comput. Commun. 21(17): 1610-1623 (1998) - [j20]Anthony C. Kam, Kai-Yeung Siu, Richard A. Barry, Eric A. Swanson:
Toward best-effort services over WDM networks with fair access and minimum bandwidth guarantee. IEEE J. Sel. Areas Commun. 16(7): 1024-1039 (1998) - [c18]Anthony C. Kam, Kai-Yeung Siu:
Linear Complexity Algorithms for Bandwidth Reservations and Delay Guarantees in Input-Queued Switches with No Speedup. ICNP 1998: 2-11 - [c17]Paolo Narváez, Kai-Yeung Siu:
New Techniques for Regulating TCP Flow over Heterogeneous Networks. LCN 1998: 42-51 - [i1]Kai-Yeung Siu, Raj Jain:
A Brief Overview of ATM: Protocol Layers, LAN Emulation, and Traffic Management. CoRR cs.NI/9809083 (1998) - 1997
- [j19]Hong-Yi Tzeng, Kai-Yeung Siu:
On Max-Min Fair Congestion Control for Multicast ABR Service in ATM. IEEE J. Sel. Areas Commun. 15(3): 545-556 (1997) - [j18]Kai-Yeung Siu:
A New Data Service In Atm? IEEE Netw. 11(4): 4-5 (1997) - [c16]Wenge Ren, Kai-Yeung Siu, Hiroshi Suzuki:
Multipoint-to-Point ABR Service in ATM Networks. ICC (3) 1997: 1185-1190 - [c15]Paolo Narváez, Kai-Yeung Siu:
Optimal Feedback Control for ABR Service in ATM. ICNP 1997: 32- - [c14]Yuan Wu, Kai-Yeung Siu, Wenge Ren:
Improved virtual queueing and dynamic EPD techniques for TCP over ATM. ICNP 1997: 212-219 - 1996
- [j17]Kai-Yeung Siu, Hong-Yi Tzeng:
Performance of TCP over ATM with time-varying available bandwidth. Comput. Commun. 19(11): 927-936 (1996) - [j16]Hongqing Li, Kai-Yeung Siu, Hong-Yi Tzeng, Chinatsu Ikeda, Hiroshi Suzuki:
On TCP performance in ATM networks with per-VC early packet discard mechanisms. Comput. Commun. 19(13): 1065-1076 (1996) - [j15]Haigeng Wang, Alexandru Nicolau, Kai-Yeung Siu:
The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints. IEEE Trans. Computers 45(11): 1257-1271 (1996) - [j14]Haigeng Wang, Alexandru Nicolau, Stephen Keung, Kai-Yeung Siu:
Computing Programs Containing Band Linear Recurrences on Vector Supercomputers. IEEE Trans. Parallel Distributed Syst. 7(8): 769-782 (1996) - [c13]Hongqing Li, Kai-Yeung Siu, Hong-Yi Tzeng, Chinatsu Ikeda, Hiroshi Suzuki:
A Simulation Study of TCP Performance in ATM Networks with ABR and UBR Services. INFOCOM 1996: 1269-1276 - 1995
- [j13]Kai-Yeung Siu, Raj Jain:
A brief overview of ATM: protocol layers, LAN emulation, and traffic management. Comput. Commun. Rev. 25(2): 6-20 (1995) - [j12]Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath:
Vector Analysis of Threshold Functions. Inf. Comput. 120(1): 22-31 (1995) - [j11]Hong-Yi Tzeng, Kai-Yeung Siu:
On the Message and Time Complexity of Protocols for Reliable Broadcasts/Multicasts in Networks with Omission Failures. IEEE J. Sel. Areas Commun. 13(7): 1296-1308 (1995) - [j10]Hong-Yi Tzeng, Kai-Yeung Siu:
Message-Optimal Protocols for Fault-Tolerant Broadcasts/Multicasts in Distributed Systems with Crash Failures. IEEE Trans. Computers 44(2): 346-352 (1995) - [j9]Vwani P. Roychowdhury, Kai-Yeung Siu, Thomas Kailath:
Classification of linearly nonseparable patterns by linear threshold elements. IEEE Trans. Neural Networks 6(2): 318-331 (1995) - [c12]Kai-Yeung Siu, Hong-Yi Tzeng:
How Effective Are One-bit Protocols? FTDCS 1995: 135-142 - [c11]Kai-Yeung Siu, Hong-Yi Tzeng:
On the Latency in Client/Server Networks. ICCCN 1995: 88 - [c10]Stephen Keung, Kai-Yeung Siu:
Efficient protocols secure against guessing and replay attacks. ICCCN 1995: 105 - 1994
- [j8]Kai-Yeung Siu, Hong-Yi Tzeng:
Intelligent congestion control for ABR service in ATM networks. Comput. Commun. Rev. 24(5): 81-106 (1994) - [j7]Kai-Yeung Siu, Amir Dembo, Thomas Kailath:
On the Perceptron Learning Algorithm on Data with High Precision. J. Comput. Syst. Sci. 48(2): 347-356 (1994) - [j6]Kai-Yeung Siu, Vwani P. Roychowdhury:
On Optimal Depth Threshold Circuits for Multiplication and Related Problems. SIAM J. Discret. Math. 7(2): 284-292 (1994) - [j5]Kai-Yeung Siu, Vwani P. Roychowdhury, Thomas Kailath:
Rational approximation techniques for analysis of neural networks. IEEE Trans. Inf. Theory 40(2): 455-466 (1994) - [j4]Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu:
Lower bounds on threshold and related circuits via communication complexity. IEEE Trans. Inf. Theory 40(2): 467-474 (1994) - [c9]Haigeng Wang, Alexandru Nicolau, Stephen Keung, Kai-Yeung Siu:
Scalable Techniques for Computing Band Linear Recurrences on Massively Parallel and Vector Supercomputers. IPPS 1994: 502-508 - 1993
- [j3]Kai-Yeung Siu, Jehoshua Bruck, Thomas Kailath, Thomas Hofmeister:
Depth efficient neural networks for division and related problems. IEEE Trans. Inf. Theory 39(3): 946-956 (1993) - [c8]Haigeng Wang, Nikil D. Dutt, Alexandru Nicolau, Kai-Yeung Siu:
High-Level Synthesis of Scalable Architectures for IIR Filters using Multichip Modules. DAC 1993: 336-342 - [c7]Vwani P. Roychowdhury, Kai-Yeung Siu:
Complexity Issues in Neural Computation and Learning. NIPS 1993: 1161-1162 - 1992
- [c6]Kai-Yeung Siu, Vwani P. Roychowdhury, Thomas Kailath:
Computing with Almost Optimal Size Neural Networks. NIPS 1992: 19-26 - [c5]Kai-Yeung Siu, Vwani P. Roychowdhury:
Optimal Depth Neural Networks for Multiplication and Related Problems. NIPS 1992: 59-64 - 1991
- [j2]Kai-Yeung Siu, Jehoshua Bruck:
On the Power of Threshold Circuits with Small Weights. SIAM J. Discret. Math. 4(3): 423-435 (1991) - [j1]Kai-Yeung Siu, Vwani P. Roychowdhury, Thomas Kailath:
Depth-Size Tradeoffs for Neural Computation. IEEE Trans. Computers 40(12): 1402-1412 (1991) - [c4]Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath:
A Geometric Approach to Threshold Circuit Complexity. COLT 1991: 97-111 - [c3]Kai-Yeung Siu, Jehoshua Bruck:
Neural Computing with Small Weights. NIPS 1991: 944-949 - 1990
- [c2]Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu, Thomas Kailath:
On the Circuit Complexity of Neural Networks. NIPS 1990: 953-959
1980 – 1989
- 1989
- [c1]Amir Dembo, Kai-Yeung Siu, Thomas Kailath:
Complexity of Finite Precision Neural Network Classifier. NIPS 1989: 668-675
Coauthor Index
aka: Hong-Yi Tzeng
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
