scispace - formally typeset
Search or ask a question
Institution

Telcordia Technologies

About: Telcordia Technologies is a based out in . It is known for research contribution in the topics: Network packet & Node (networking). The organization has 3097 authors who have published 4737 publications receiving 237882 citations.


Papers
More filters
Patent
26 Jan 1988
TL;DR: The packet switch as discussed by the authors is a hybrid switch comprising both optical and electronic devices and specifically comprises and electronic input buffer, an optical transport network and an optical control network, which can prevent internal collisions within the switch and prevent external collisions of packets.
Abstract: A switch for receiving packets on optical fiber input trunks and for switching the packets to appropriate optical fiber output trunks is disclosed. The packet switch is a hybrid switch comprising both optical and electronic devices and specifically comprises and electronic input buffer, an optical transport network and an optical control network. The optical transport network prevents internal collisions within the switch and the optical control network prevents external collisions of packets. The packet switch exploits the inherent properties of optical and electronic devices for the specific functions they are best suited for.

63 citations

Book
03 May 2002
TL;DR: In this article, the authors examine policy design when the policy maker in imperfectly informed, focusing on cases where the regulated firm possesses better information about its technology than the regulator, and examine the impact of imperfect information on policy design.
Abstract: Examines policy design when the policy maker in imperfectly informed, focusing on cases where the regulated firm possesses better information about its technology than the regulator.

63 citations

Journal ArticleDOI
TL;DR: This work considers the problem of finding a polygon nested between two given convex polygons that has a minimal number of vertices, and presents an O(n log k) algorithm for solving the problem, where n is the total number of Vertices of the given polygons.
Abstract: We consider the problem of finding a polygon nested between two given convex polygons that has a minimal number of vertices. Our main result is an O(n log k) algorithm for solving the problem, where n is the total number of vertices of the given polygons, and k is the number of vertices of a minimal nested polygon. We also present an O(n) sub-optimal algorithm, and a simple O(nk) optimal algorithm.

63 citations

Book ChapterDOI
15 Aug 2004
TL;DR: In the bare public-key model, each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times, constant-round black-box concurrent and resettable zero knowledge is possible as opposed to the standard model for zero knowledge.
Abstract: In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, introduced by Canetti et al. [STOC 2000], constant-round black-box concurrent and resettable zero knowledge is possible as opposed to the standard model for zero knowledge. As pointed out by Micali and Reyzin [Crypto 2001], the notion of soundness in this model is more subtle and complex than in the classical model and indeed four distinct notions have been introduced (from weakest to strongest): one-time, sequential, concurrent and resettable soundness.

63 citations

Journal ArticleDOI
TL;DR: In this article, the authors developed alternatives to maximum likelihood estimators (MLE) for logistic regression models and compared the mean squared error (MSE) of the estimators.
Abstract: This paper develops alternatives to maximum likelihood estimators (MLE) for logistic regression models and compares the mean squared error (MSE) of the estimators. The MLE for the vector of underlying success probabilities has low MSE only when the true probabilities are extreme (i.e., near 0 or 1). Extreme probabilities correspond to logistic regression parameter vectors which are large in norm. A competing “restricted” MLE and an empirical version of it are suggested as estimators with better performance than the MLE for central probabilities. An approximate EM-algorithm for estimating the restriction is described. As in the case of normal theory ridge estimators, the proposed estimators are shown to be formally derivable by Bayes and empirical Bayes arguments. The small sample operating characteristics of the proposed estimators are compared to the MLE via a simulation study; both the estimation of individual probabilities and of logistic parameters are considered.

63 citations


Authors

Showing all 3097 results

NameH-indexPapersCitations
Joseph E. Stiglitz1641142152469
Pete Smith1562464138819
Jean-Marie Tarascon136853137673
Ramamoorthy Ramesh12264967418
Martin Vetterli10576157825
Noga Alon10489544575
Amit P. Sheth10175342655
Harold G. Craighead10156940357
Susan T. Dumais10034660206
Andrzej Cichocki9795241471
Robert E. Kraut9729738116
Kishor S. Trivedi9569836816
David R. Clarke9055336039
Axel Scherer9073643939
Michael R. Lyu8969633257
Network Information
Related Institutions (5)
Alcatel-Lucent
53.3K papers, 1.4M citations

88% related

Bell Labs
59.8K papers, 3.1M citations

87% related

IBM
253.9K papers, 7.4M citations

83% related

Hewlett-Packard
59.8K papers, 1.4M citations

82% related

Eindhoven University of Technology
52.9K papers, 1.5M citations

81% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20191
20182
20171
20161
20151
20143