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
Journal ArticleDOI
01 Apr 1986
TL;DR: This paper explores fisheye views presenting, in turn, naturalistic studies, a general formalism, a specific instantiation, a resulting computer program, example displays and an evaluation.
Abstract: In many contexts, humans often represent their own “neighborhood” in great detail, yet only major landmarks further away. This suggests that such views (“fisheye views”) might be useful for the computer display of large information structures like programs, data bases, online text, etc. This paper explores fisheye views presenting, in turn, naturalistic studies, a general formalism, a specific instantiation, a resulting computer program, example displays and an evaluation.

2,164 citations

Proceedings ArticleDOI
01 Jun 1986
TL;DR: The authors used machine readable dictionaries and looked for words in sense definitions that overlap words in the definition of nearby words to decide automatically which sense of a word is intended (in written English).
Abstract: The meaning of an English word can vary widely depending on which sense is intended. Does a fireman feed fires or put them out? It depends on whether or not he is on a steam locomotive. I am trying to decide automatically which sense of a word is intended (in written English) by using machine readable dictionaries, and looking for words in the sense definitions that overlap words in the definition of nearby words. The problem of deciding which sense of a word was intended by the writer is an important problem in information retrieval systems. At present most retrieval systems rely on manual indexing; if this is to be replaced with automatic text processing, it would be very desirable to recognize the correct sense of each word as often as possible. Previous work has generally either suggested (a) detailed frames describing the particular word senses,t*’ or (b) global statistics about the word occurrences.3 The first has not yet been made available in any real application, and the second may give the wrong answer in specific local instances. This procedure uses available dictionaries, so that it will process any text; and uses solely the immediate context. To consider the example in the title, look at the definition of pine in the Oxford Advanced Learner’s Dictionary of Current English: there are, of course, two major senses. “kind of evergreen tree with needle-shaped leaves.. .” and “waste away through sorrow or illness...” And cone has three separate definitions: “solid body which narrows to a’ point . . . . *’ “something of this shape w-hether solid or hollow...,” and “fruit of certain evergreen trees...” Note that both evergreen and tree are common to two of the sense definitions: thus a program could guess that if the two words pine cone appear together, the likely senses are those of the tree and its fruit

2,056 citations

Journal ArticleDOI
TL;DR: This paper shows how to do an on-line simulation of an arbitrary RAM by a probabilistic oblivious RAM with a polylogaithmic slowdown in the running time, and shows that a logarithmic slowdown is a lower bound.
Abstract: Software protection is one of the most important issues concerning computer practice. There exist many heuristics and ad-hoc methods for protection, but the problem as a whole has not received the theoretical treatment it deserves. In this paper, we provide theoretical treatment of software protection. We reduce the problem of software protection to the problem of efficient simulation on oblivious RAM.A machine is oblivious if thhe sequence in which it accesses memory locations is equivalent for any two inputs with the same running time. For example, an oblivious Turing Machine is one for which the movement of the heads on the tapes is identical for each computation. (Thus, the movement is independent of the actual input.) What is the slowdown in the running time of a machine, if it is required to be oblivious? In 1979, Pippenger and Fischer showed how a two-tape oblivious Turing Machine can simulate, on-line, a one-tape Turing Machine, with a logarithmic slowdown in the running time. We show an analogous result for the random-access machine (RAM) model of computation. In particular, we show how to do an on-line simulation of an arbitrary RAM by a probabilistic oblivious RAM with a polylogaithmic slowdown in the running time. On the other hand, we show that a logarithmic slowdown is a lower bound.

1,752 citations

Patent
19 Sep 1995
TL;DR: In this article, a personal communications internetworking (PCIOW) system is proposed to provide a network subscriber with the ability to remotely control the receipt and delivery of wireless and wireline voice and text messages.
Abstract: A personal communications internetworking (40) provides a network subscriber with the ability to remotely control the receipt and delivery of wireless and wireline voice and text messages. The network operates as an interface between various wireless (39) and wireline (29) networks, and also performs media translation, where necessary. The subscriber's message receipt and delivery options are maintained in a database which the subscriber may access by wireless or wireline communications to update the options programmed in the database. The subscriber may be provided with Call/Command service which provides real-time control of voice calls while using a wireless data terminal (32, 34) or PDA (30).

1,650 citations

Journal ArticleDOI
TL;DR: It is shown how this fundamental property of language limits the success of various design methodologies for vocabulary-driven interaction, and an optimal strategy, unlimited aliasing, is derived and shown to be capable of several-fold improvements.
Abstract: In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in first-tries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five application-related domains, and found the variability to be surprisingly large. In every case two people favored the same term with probability

1,534 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