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.

Topics: Network packet, Node (networking), Wireless ad hoc network, Wireless network, Quality of service

##### Papers published on a yearly basis

##### Papers

More filters

••

TL;DR: If a three-dimensionally periodic dielectric structure has an electromagnetic band gap which overlaps the electronic band edge, then spontaneous emission can be rigorously forbidden.

Abstract: It has been recognized for some time that the spontaneous emission by atoms is not necessarily a fixed and immutable property of the coupling between matter and space, but that it can be controlled by modification of the properties of the radiation field. This is equally true in the solid state, where spontaneous emission plays a fundamental role in limiting the performance of semiconductor lasers, heterojunction bipolar transistors, and solar cells. If a three-dimensionally periodic dielectric structure has an electromagnetic band gap which overlaps the electronic band edge, then spontaneous emission can be rigorously forbidden.

12,787 citations

••

TL;DR: A new method for automatic indexing and retrieval to take advantage of implicit higher-order structure in the association of terms with documents (“semantic structure”) in order to improve the detection of relevant documents on the basis of terms found in queries.

Abstract: A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (“semantic structure”) in order to improve the detection of relevant documents on the basis of terms found in queries. The particular technique used is singular-value decomposition, in which a large term by document matrix is decomposed into a set of ca. 100 orthogonal factors from which the original matrix can be approximated by linear combination. Documents are represented by ca. 100 item vectors of factor weights. Queries are represented as pseudo-document vectors formed from weighted combinations of terms, and documents with supra-threshold cosine values are returned. initial tests find this completely automatic method for retrieval to be promising.

12,443 citations

••

TL;DR: Locally weighted regression as discussed by the authors is a way of estimating a regression surface through a multivariate smoothing procedure, fitting a function of the independent variables locally and in a moving fashion analogous to how a moving average is computed for a time series.

Abstract: Locally weighted regression, or loess, is a way of estimating a regression surface through a multivariate smoothing procedure, fitting a function of the independent variables locally and in a moving fashion analogous to how a moving average is computed for a time series With local fitting we can estimate a much wider class of regression surfaces than with the usual classes of parametric functions, such as polynomials The goal of this article is to show, through applications, how loess can be used for three purposes: data exploration, diagnostic checking of parametric models, and providing a nonparametric regression surface Along the way, the following methodology is introduced: (a) a multivariate smoothing procedure that is an extension of univariate locally weighted regression; (b) statistical procedures that are analogous to those used in the least-squares fitting of parametric functions; (c) several graphical methods that are useful tools for understanding loess estimates and checking the a

5,188 citations

••

02 May 2004

TL;DR: This work defines and construct a mechanism that enables Alice to provide a key to the gateway that enables the gateway to test whether the word “urgent” is a keyword in the email without learning anything else about the email.

Abstract: We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice’s public key. An email gateway wants to test whether the email contains the keyword “urgent” so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the ability to decrypt all her messages. We define and construct a mechanism that enables Alice to provide a key to the gateway that enables the gateway to test whether the word “urgent” is a keyword in the email without learning anything else about the email. We refer to this mechanism as Public Key Encryption with keyword Search. As another example, consider a mail server that stores various messages publicly encrypted for Alice by others. Using our mechanism Alice can send the mail server a key that will enable the server to identify all messages containing some specific keyword, but learn nothing else. We define the concept of public key encryption with keyword search and give several constructions.

3,024 citations

••

3,009 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 |