scispace - formally typeset
Search or ask a question
Institution

AT&T Labs

Company
About: AT&T Labs is a based out in . It is known for research contribution in the topics: Network packet & The Internet. The organization has 1879 authors who have published 5595 publications receiving 483151 citations.


Papers
More filters
Proceedings Article
30 Jun 2000
TL;DR: It is shown that, given data from a mixture of k well-separated spherical Gaussians in Rn, a simple two-round variant of EM will, with high probability, learn the centers of the Gaussian to near-optimal precision, if the dimension is high.
Abstract: We show that, given data from a mixture of k well-separated spherical Gaussians in Rn, a simple two-round variant of EM will, with high probability, learn the centers of the Gaussians to near-optimal precision, if the dimension is high (n ≫ log k). We relate this to previous theoretical and empirical work on the EM algorithm.

141 citations

Journal ArticleDOI
TL;DR: This paper extends I. Constantinescu's concept of homogeneous weights on arbitrary finite rings and proves MacWilliams' equivalence theorem to hold with respect to these weights for all finite Frobenius rings and establishes a general inversion principle for real functions on finite modules that involves Mobius inversion on partially ordered sets.

141 citations

Journal ArticleDOI
01 Aug 2001-Networks
TL;DR: A multistart local search algorithm for the prize‐collecting Steiner tree problem is described, based on the generation of initial solutions by a primal‐dual algorithm using perturbed node prizes, which found optimal solutions on nearly all of the instances tested.
Abstract: Given an undirected graph with prizes associated with its nodes and weights associated with its edges, the prize-collecting Steiner tree problem consists of finding a subtree of this graph which minimizes the sum of the weights of its edges plus the prizes of the nodes not spanned. In this paper, we describe a multistart local search algorithm for the prize-collecting Steiner tree problem, based on the generation of initial solutions by a primal-dual algorithm using perturbed node prizes. Path-relinking is used to improve the solutions found by local search and variable neighborhood search is used as a post-optimization procedure. Computational experiments involving different algorithm variants are reported. Our results show that the local search with perturbations approach found optimal solutions on nearly all of the instances tested. © 2001 John Wiley & Sons, Inc.

140 citations

Journal ArticleDOI
TL;DR: In this paper, the authors report the successful transmission of 64 Tb/s capacity (640 ×107 Gb/S with 12.5 GHz channel spacing) over 320 km reach utilizing 8-THz of spectrum in the C+L -bands at a net spectral efficiency of 8 bit/s/Hz.
Abstract: We report the successful transmission of 64 Tb/s capacity (640 ×107 Gb/s with 12.5 GHz channel spacing) over 320 km reach utilizing 8-THz of spectrum in the C+L -bands at a net spectral efficiency of 8 bit/s/Hz. Such a result is accomplished by the use of raised-cosine pulse-shaped PDM-36QAM modulation, intradyne detection, both pre- and post-transmission digital equalization, and ultra-large-area fiber. We discuss in detail the digital modulation technology and signal processing algorithms used in the experiment, including a new two-stage, blind frequency-search-based frequency-offset estimation algorithm and a more computationally efficient carrier-phase recovery algorithm.

139 citations

Journal ArticleDOI
TL;DR: This work presents general "sketch"-based methods for capturing various linear projections and use them to provide pointwise and rangesum estimation of data streams.
Abstract: We present techniques for computing small space representations of massive data streams. These are inspired by traditional wavelet-based approximations that consist of specific linear projections of the underlying data. We present general "sketch"-based methods for capturing various linear projections and use them to provide pointwise and rangesum estimation of data streams. These methods use small amounts of space and per-item time while streaming through the data and provide accurate representation as our experiments with real data streams show.

139 citations


Authors

Showing all 1881 results

NameH-indexPapersCitations
Yoshua Bengio2021033420313
Scott Shenker150454118017
Paul Shala Henry13731835971
Peter Stone130122979713
Yann LeCun121369171211
Louis E. Brus11334763052
Jennifer Rexford10239445277
Andreas F. Molisch9677747530
Vern Paxson9326748382
Lorrie Faith Cranor9232628728
Ward Whitt8942429938
Lawrence R. Rabiner8837870445
Thomas E. Graedel8634827860
William W. Cohen8538431495
Michael K. Reiter8438030267
Network Information
Related Institutions (5)
Microsoft
86.9K papers, 4.1M citations

94% related

Google
39.8K papers, 2.1M citations

91% related

Hewlett-Packard
59.8K papers, 1.4M citations

89% related

Bell Labs
59.8K papers, 3.1M citations

88% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20225
202133
202069
201971
2018100
201791