• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 983,044
Next 10 →

Searching for illustrative sentences for multiword expressions in a research paper database. Lecture notes in computer science 5362. ICADL

by Hidetsugu Nanba, Satoshi Morishita , 2008
"... cu.ac.jp Abstract. We propose a method to search for illustrative sentences for English multiword expressions (MWEs) from a research paper database. We focus on syntactically flexible expressions such as “regard – as. ” Traditionally, illustrative sentences that contain such expressions have been se ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
cu.ac.jp Abstract. We propose a method to search for illustrative sentences for English multiword expressions (MWEs) from a research paper database. We focus on syntactically flexible expressions such as “regard – as. ” Traditionally, illustrative sentences that contain such expressions have been

Efficient similarity search in sequence databases

by Rakesh Agrawal, Christos Faloutsos, Arun Swami , 1994
"... We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Anot ..."
Abstract - Cited by 505 (21 self) - Add to MetaCart
the sequences and e ciently answer similarity queries. We provide experimental results which show that our method is superior to search based on sequential scanning. Our experiments show that a few coefficients (1-3) are adequate to provide good performance. The performance gain of our method increases

The mathematics of sentence structure

by Joachim Lambek - AMERICAN MATHEMATICAL MONTHLY , 1958
"... ..."
Abstract - Cited by 581 (3 self) - Add to MetaCart
Abstract not found

A Fast Quantum Mechanical Algorithm for Database Search

by Lov K. Grover - ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING , 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract - Cited by 1126 (10 self) - Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of names. Quantum mechanical systems can be in a

Comparison of parametric representations for monosyllabic word recognition in continuously spoken sentences

by Steven B. Davis, Paul Mermelstein - ACOUSTICS, SPEECH AND SIGNAL PROCESSING, IEEE TRANSACTIONS ON , 1980
"... Several parametric representations of the acoustic signal were compared as to word recognition performance in a syllable-oriented continuous speech recognition system. The vocabulary in-cluded many phonetically similar monosyllabic words, therefore the emphasis was on ability to retain phonetically ..."
Abstract - Cited by 1089 (2 self) - Add to MetaCart
Several parametric representations of the acoustic signal were compared as to word recognition performance in a syllable-oriented continuous speech recognition system. The vocabulary in-cluded many phonetically similar monosyllabic words, therefore the emphasis was on ability to retain

Gapped Blast and PsiBlast: a new generation of protein database search programs

by Stephen F. Altschul, Thomas L. Madden, Alejandro A. Schäffer, Jinghui Zhang, Zheng Zhang, Webb Miller, David J. Lipman - NUCLEIC ACIDS RESEARCH , 1997
"... The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantially while ..."
Abstract - Cited by 8393 (85 self) - Add to MetaCart
The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantially while

Querying object-oriented databases

by Michael Kifer, Won Kim, Yehoshua Sagiv - ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1992
"... We present a novel language for querying object-oriented databases. The language is built around the idea of extended path expressions that substantially generalize [ZAN83], and on an adaptation of the first-order formalization of object-oriented languages from [KW89, KLW90, KW92]. The language inco ..."
Abstract - Cited by 493 (6 self) - Add to MetaCart
We present a novel language for querying object-oriented databases. The language is built around the idea of extended path expressions that substantially generalize [ZAN83], and on an adaptation of the first-order formalization of object-oriented languages from [KW89, KLW90, KW92]. The language

Parallel database systems: the future of high performance database systems

by David J. Dewitt, Jim Gray - Communications of the ACM , 1992
"... Abstract: Parallel database machine architectures have evolved from the use of exotic hardware to a software parallel dataflow architecture based on conventional shared-nothing hardware. These new designs provide impressive speedup and scaleup when processing relational database queries. This paper ..."
Abstract - Cited by 638 (13 self) - Add to MetaCart
Abstract: Parallel database machine architectures have evolved from the use of exotic hardware to a software parallel dataflow architecture based on conventional shared-nothing hardware. These new designs provide impressive speedup and scaleup when processing relational database queries. This paper

WordNet: An on-line lexical database

by George A. Miller, Richard Beckwith, Christiane Fellbaum, Derek Gross, Katherine Miller - International Journal of Lexicography , 1990
"... WordNet is an on-line lexical reference system whose design is inspired by current ..."
Abstract - Cited by 1945 (9 self) - Add to MetaCart
WordNet is an on-line lexical reference system whose design is inspired by current

Federated database systems for managing distributed, heterogeneous, and autonomous databases

by Amit P. Sheth, James A. Larson - ACM Computing Surveys , 1990
"... A federated database system (FDBS) is a collection of cooperating database systems that are autonomous and possibly heterogeneous. In this paper, we define a reference architecture for distributed database management systems from system and schema viewpoints and show how various FDBS architectures c ..."
Abstract - Cited by 1209 (34 self) - Add to MetaCart
A federated database system (FDBS) is a collection of cooperating database systems that are autonomous and possibly heterogeneous. In this paper, we define a reference architecture for distributed database management systems from system and schema viewpoints and show how various FDBS architectures
Next 10 →
Results 1 - 10 of 983,044
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University