scispace - formally typeset
Search or ask a question
Author

Thomas H. Cormen

Bio: Thomas H. Cormen is an academic researcher from Dartmouth College. The author has contributed to research in topics: Permutation & Out-of-core algorithm. The author has an hindex of 20, co-authored 55 publications receiving 28277 citations. Previous affiliations of Thomas H. Cormen include Massachusetts Institute of Technology.


Papers
More filters
Proceedings Article
01 Jan 1999

2 citations

22 Aug 1986
TL;DR: A VLSI chip is designed which is capable of concentrating bit-serial messages quickly and has a highly regular layout using ratioed nMOS and takes advantage of the relatively fast performance of large fan-inNOR gates in this technology.
Abstract: : In highly parallel message routing networks, it is sometimes desirable to concentrate relatively few messages on many wires onto fewer wires. We have designed a VLSI chip for this purpose which is capable of concentrating bit-serial messages quickly. This hyperconcentrator switch has a highly regular layout using ratioed nMOS and takes advantage of the relatively fast performance of large fan-inNOR gates in this technology. A signal incurs exactly 2 log2 n gate delays through the switch, where n is the number of inputs to the circuit. The architecture generalizes to domino CMOS as well. (REPRINTS)

2 citations

Proceedings Article
01 Feb 1987
TL;DR: This paper presents designs for two multichip partial concentrator switches, both of which follow from a lemma showing that an epsilon nearsorter is also an (n, m, 1-epsilon/m)partial concentrator.
Abstract: : Due to chip area and pin count constraints, large concentrator switches sometimes must be partitioned among several chips. This paper presents designs for two multichip partial concentrator switches, both of which follow from a lemma showing that an epsilon nearsorter is also an (n, m, 1-epsilon/m) partial concentrator. Keywords include: nearsorting, message routing network, bit-serial message, concentrator switch, hyperconcentrator switch, partial concentrator switch, revsort, and columnsort.

2 citations

Proceedings ArticleDOI
01 Sep 2016
TL;DR: Two methods to compute Gray codes containing exactly n numbers in the range 0 to n − 1 are presented, each number in the output sequence can be computed in a constant number of word operations given just its index in the sequence.
Abstract: The standard binary reflected Gray code gives a sequence of binary numbers in the range 0 to n − 1, where n is a power of 2, such that each number in the sequence differs from the preceding number in only one bit. We present two methods to compute Gray codes containing exactly n numbers in the range 0 to n − 1—that is, a permutation of 〈0, 1, …, n − 1〉 in which each number differs from the preceding number in only one bit—where n is unconstrained. The first method produces a Gray code that is not cyclic: the first and last numbers in the sequence differ in more than one bit. The second method produces a cyclic Gray code if n is even, so that the first and last numbers differ in only one bit, at the expense of a slightly more complicated procedure. Both methods are based on the standard binary reflected Gray code and, as in the binary reflected Gray code, each number in the output sequence can be computed in a constant number of word operations given just its index in the sequence.

1 citations

Proceedings Article
01 Jan 2004

1 citations


Cited by
More filters
Book
01 Jan 1996
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Abstract: From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.

13,597 citations

Proceedings Article
25 Jul 2004
TL;DR: Four different RouGE measures are introduced: ROUGE-N, ROUge-L, R OUGE-W, and ROUAGE-S included in the Rouge summarization evaluation package and their evaluations.
Abstract: ROUGE stands for Recall-Oriented Understudy for Gisting Evaluation. It includes measures to automatically determine the quality of a summary by comparing it to other (ideal) summaries created by humans. The measures count the number of overlapping units such as n-gram, word sequences, and word pairs between the computer-generated summary to be evaluated and the ideal summaries created by humans. This paper introduces four different ROUGE measures: ROUGE-N, ROUGE-L, ROUGE-W, and ROUGE-S included in the ROUGE summarization evaluation package and their evaluations. Three of them have been used in the Document Understanding Conference (DUC) 2004, a large-scale summarization evaluation sponsored by NIST.

9,293 citations

Proceedings ArticleDOI
26 Mar 2000
TL;DR: RADAR is presented, a radio-frequency (RF)-based system for locating and tracking users inside buildings that combines empirical measurements with signal propagation modeling to determine user location and thereby enable location-aware services and applications.
Abstract: The proliferation of mobile computing devices and local-area wireless networks has fostered a growing interest in location-aware systems and services. In this paper we present RADAR, a radio-frequency (RF)-based system for locating and tracking users inside buildings. RADAR operates by recording and processing signal strength information at multiple base stations positioned to provide overlapping coverage in the area of interest. It combines empirical measurements with signal propagation modeling to determine user location and thereby enable location-aware services and applications. We present experimental results that demonstrate the ability of RADAR to estimate user location with a high degree of accuracy.

8,667 citations

Journal ArticleDOI
01 Apr 2012-Fly
TL;DR: It appears that the 5′ and 3′ UTRs are reservoirs for genetic variations that changes the termini of proteins during evolution of the Drosophila genus.
Abstract: We describe a new computer program, SnpEff, for rapidly categorizing the effects of variants in genome sequences. Once a genome is sequenced, SnpEff annotates variants based on their genomic locations and predicts coding effects. Annotated genomic locations include intronic, untranslated region, upstream, downstream, splice site, or intergenic regions. Coding effects such as synonymous or non-synonymous amino acid replacement, start codon gains or losses, stop codon gains or losses, or frame shifts can be predicted. Here the use of SnpEff is illustrated by annotating ~356,660 candidate SNPs in ~117 Mb unique sequences, representing a substitution rate of ~1/305 nucleotides, between the Drosophila melanogaster w1118; iso-2; iso-3 strain and the reference y1; cn1 bw1 sp1 strain. We show that ~15,842 SNPs are synonymous and ~4,467 SNPs are non-synonymous (N/S ~0.28). The remaining SNPs are in other categories, such as stop codon gains (38 SNPs), stop codon losses (8 SNPs), and start codon gains (297 SNPs) in...

8,017 citations