Pierre A. Humblet - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2008

An optimal soft handoff algorithm for rayleigh fading channelsSae-Young Chung, Pierre A. Humblet. TWC, 7(2):726-735, 2008. [doi]

2007

On the Robustness of Scheduling Against Channel VariationsSae-Young Chung, Pierre A. Humblet. TWC, 6(9):3186-3190, 2007. [doi]

Power Control for CDMA with Hybrid-ARQDeepak Das, Satish Ananthaiyer, Prashanth Rao, Sepehr Mehrabanzad, Mehdi Alasti, Pierre A. Humblet. vtc 2007: 996-1000 [doi]

2004

V.92: the last dial-up modem?Dae Young Kim, Pierre A. Humblet, M. Vedat Eyuboglu, Les Brown, G. David Forney Jr., Sepehr Mehrabanzad. tcom, 52(1):54-61, 2004. [doi]

2002

An all-IP software radio architecture under RTLinuxChristian Bonnet, Lionel Gauthier, Pierre A. Humblet, Raymond Knopp, Aawatif Menouni Hayar, Yan Moret, Alessandro Nordio, Dominique Nussbaum, Michelle Wetterwald. adt, 57(7-8):677-698, 2002. [doi]

Initial synchronization of DS-CDMA via bursty pilot signalsGiuseppe Caire, Pierre A. Humblet, Giuseppe Montalbano, Alessandro Nordio. tcom, 50(4):677-685, 2002. [doi]

2001

An open software-radio architecture supporting advanced 3G+ systemsChristian Bonnet, Giuseppe Caire, Alain Enout, Pierre A. Humblet, Giuseppe Montalbano, Alessandro Nordio, Dominique Nussbaum, Thomas Höhne, Raymond Knopp, Bixio Rimoldi. adt, 56(5-6):332-343, 2001. [doi]

2000

Slot timing maximum likelihood estimation with bursty pilot signals for DS-CDMA in multipath fading channelsGiuseppe Caire, Pierre A. Humblet, Giuseppe Montalbano, Alessandro Nordio. globecom 2000: 882-886 [doi]

On coding for block fading channelsRaymond Knopp, Pierre A. Humblet. TIT, 46(1):189-205, 2000.

1998

System capacity of F-TDMA cellular systemsGiuseppe Caire, Raymond Knopp, Pierre A. Humblet. tcom, 46(12):1649-1661, 1998. [doi]

1997

Maximizing Diversity on Block-Fading ChannelsRaymond Knopp, Pierre A. Humblet. icc 1997: 647-651

1996

Models of Blocking Probability in All-Optical Networks with and Without Wavelength ChangersRichard A. Barry, Pierre A. Humblet. jsac, 14(5):858-867, 1996.

The information drivewayPierre A. Humblet, Markos G. Troulis. cm, 34(12):64-68, 1996. [doi]

Zero-forcing electrical filters for direct detection optical systemsPeter C. Li, Pierre A. Humblet. tcom, 44(6):707-715, 1996. [doi]

1995

1994

On the number of wavelengths and switches in all-optical networksRichard A. Barry, Pierre A. Humblet. tcom, 42(234):583-591, 1994. [doi]

Buffer Allocation for Frame Reassembly and Queueing in ATM NetworksPierre A. Humblet, Whay Chiou Lee, Michael G. Hluchyj. infocom 1994: 510-515

1993

1992

An Efficient Communication Protocol for High-Speed Packet-Switched Multichannel NetworksPierre A. Humblet, Rajiv Ramaswami, Kumar N. Sivarajan. sigcomm 1992: 2-13 [doi]

A method for isochronous traffic in a WDM star networkGhassan Semaan, Pierre A. Humblet. lcn 1992: 541-547 [doi]

1991

Another adaptive distributed shortest path algorithmPierre A. Humblet. tcom, 39(6):995-1003, 1991. [doi]

Slotted ALOHA in High Speed Bidirectional Bus NetworksWhay Chiou Lee, Pierre A. Humblet. infocom 1991: 221-227

Distributed network protocols for changing topologies: a counterexampleStuart R. Soloway, Pierre A. Humblet. tcom, 39(3):360-361, 1991. [doi]

1990

Crosstalk Analysis and Filter Optimization of Single- and Double-Cavity Fabry-Perot FiltersPierre A. Humblet, Walid M. Hamdy. jsac, 8(6):1095-1107, 1990.

Average waiting time assignment. I. The single link caseJean Regnier, Pierre A. Humblet. tcom, 38(11):2049-2059, 1990. [doi]

Average waiting time assignment. II. The integrated services network caseJean Regnier, Pierre A. Humblet. tcom, 38(11):2060-2072, 1990. [doi]

1989

Topology Broadcast AlgorithmsPierre A. Humblet, Stuart R. Soloway. cn, 16:179-186, 1989.

1986

On the Throughput of Channel Access Algorithms with Limited SensingPierre A. Humblet. tcom, 34(4):345-347, 1986. [doi]

The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational ProcedureWarren B. Powell, Pierre A. Humblet. ior, 34(2):267-275, 1986. [doi]

The performance of a precedence-based queuing disciplineJohn N. Tsitsiklis, Christos H. Papadimitriou, Pierre A. Humblet. JACM, 33(3):593-602, 1986. [doi]

1985

The capacity region of the totally asynchronous multiple-access channelJ. Y. N. Hui, Pierre A. Humblet. TIT, 31(2):207-216, 1985.

A Class of Efficient Contention Resolution Algorithms for Multiple Access ChannelsJeannine Mosely, Pierre A. Humblet. tcom, 33(2):145-151, 1985. [doi]

1983

A Distributed Algorithm for Minimum-Weight Spanning TreesRobert G. Gallager, Pierre A. Humblet, Philip M. Spira. TOPLAS, 5(1):66-77, 1983. [doi]

A Distributed Algorithm for Minimum Weight Directed Spanning TreesPierre A. Humblet. tcom, 31(6):756-762, 1983. [doi]

Technical Note - Mean Drifts and the Non-Ergodicity of Markov ChainsLinn I. Sennott, Pierre A. Humblet, Richard L. Tweedie. ior, 31(4):783-789, 1983. [doi]

1981

Generalization of Huffman coding to minimize the probability of buffer overflowPierre A. Humblet. TIT, 27(2):230, 1981.

1978

Optimal source coding for a class of integer alphabets (Corresp.)Pierre A. Humblet. TIT, 24(1):110-112, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL