Papers published on a yearly basis
Papers
More filters
•
26 Jan 1988TL;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
•
03 May 2002TL;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
••
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
••
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
••
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
Name | H-index | Papers | Citations |
---|---|---|---|
Joseph E. Stiglitz | 164 | 1142 | 152469 |
Pete Smith | 156 | 2464 | 138819 |
Jean-Marie Tarascon | 136 | 853 | 137673 |
Ramamoorthy Ramesh | 122 | 649 | 67418 |
Martin Vetterli | 105 | 761 | 57825 |
Noga Alon | 104 | 895 | 44575 |
Amit P. Sheth | 101 | 753 | 42655 |
Harold G. Craighead | 101 | 569 | 40357 |
Susan T. Dumais | 100 | 346 | 60206 |
Andrzej Cichocki | 97 | 952 | 41471 |
Robert E. Kraut | 97 | 297 | 38116 |
Kishor S. Trivedi | 95 | 698 | 36816 |
David R. Clarke | 90 | 553 | 36039 |
Axel Scherer | 90 | 736 | 43939 |
Michael R. Lyu | 89 | 696 | 33257 |