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

CiteSeerX logo

Advanced Search Include Citations

Tools

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

Parallel Networks that Learn to Pronounce English Text

by Terrence J. Sejnowski, Charles R. Rosenberg - COMPLEX SYSTEMS , 1987
"... This paper describes NETtalk, a class of massively-parallel network systems that learn to convert English text to speech. The memory representations for pronunciations are learned by practice and are shared among many processing units. The performance of NETtalk has some similarities with observed h ..."
Abstract - Cited by 548 (5 self) - Add to MetaCart
task, but differ completely at the levels of synaptic strengths and single-unit responses. However, hierarchical clustering techniques applied to NETtalk reveal that these different networks have similar internal representations of letter-to-sound correspondences within groups of processing units

Re-Engineering Letter-to-Sound Rules

by Martin Jansche , 2001
"... Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled are difficult to write and maintain, and the resulting automata can become very large and therefore inefficient. Convertin ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled are difficult to write and maintain, and the resulting automata can become very large and therefore inefficient

Strategy-Proofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions

by Mark Allen Satterthwaite - J. Econ. Theory , 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategy-proof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract - Cited by 542 (0 self) - Add to MetaCart
prove three theorems. First, every strategy-proof voting procedure is dictatorial. Second, this paper’s strategy-proofness condition for voting procedures corre-sponds to Arrow’s rationality, independence of irrelevant alternatives, non-negative response, and citizens ’ sovereignty conditions for social

Verb Semantics And Lexical Selection

by Zhibiao Wu , 1994
"... ... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semantic-syntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new ..."
Abstract - Cited by 520 (4 self) - Add to MetaCart
... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semantic-syntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor

Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering

by Mikhail Belkin, Partha Niyogi - Advances in Neural Information Processing Systems 14 , 2001
"... Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in a higher ..."
Abstract - Cited by 664 (8 self) - Add to MetaCart
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in a

Object exchange across heterogeneous information sources

by Yannis Papakonstantinou, Hector Garcia-molina, Jennifer Widom - INTERNATIONAL CONFERENCE ON DATA ENGINEERING , 1995
"... We address the problem of providing integrated access to diverse and dynamic information sources. We explain how this problem differs from the traditional database integration problem and we focus on one aspect of the information integration problem, namely information exchange. We define an object- ..."
Abstract - Cited by 513 (57 self) - Add to MetaCart
-based information exchange model and a corresponding query language that we believe are well suited for integration of diverse information sources. We describe how, the model and language have been used to integrate heterogeneous bibliographic information sources. We also describe two general-purpose libraries we

Distributed Computing in Practice: The Condor Experience

by Douglas Thain, Todd Tannenbaum, Miron Livny - Concurrency and Computation: Practice and Experience , 2005
"... Since 1984, the Condor project has enabled ordinary users to do extraordinary computing. Today, the project continues to explore the social and technical problems of cooperative computing on scales ranging from the desktop to the world-wide computational grid. In this chapter, we provide the history ..."
Abstract - Cited by 542 (7 self) - Add to MetaCart
the history and philosophy of the Condor project and describe how it has interacted with other projects and evolved along with the field of distributed computing. We outline the core components of the Condor system and describe how the technology of computing must correspond to social structures. Throughout

A Structural Approach to Operational Semantics

by G. D. Plotkin , 1981
"... Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be ..."
Abstract - Cited by 1541 (3 self) - Add to MetaCart
Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can

Sequence Logos: A New Way to Display Consensus Sequences

by homas D. Schneider, Thomas D. Schneider, R. Michael Stephens - Nucleic Acids Res , 1990
"... INTRODUCTION A logo is "a single piece of type bearing two or more usually separate elements" [1]. In this paper, we use logos to display aligned sets of sequences. Sequence logos concentrate the following information into a single graphic [2]: 1. The general consensus of the sequences. ..."
Abstract - Cited by 638 (27 self) - Add to MetaCart
. National Cancer Institute, Frederick Cancer Research and Development Center, Laboratory of Mathematical Biology, P. O. Box B, Frederick, MD 21701. Internet addresses: toms@ncifcrf.gov and stephens@ncifcrf.gov. y corresponding author 1 2. The order of predominance of the residues at every position. 3

Goal-directed Requirements Acquisition

by Anne Dardenne , Axel van Lamsweerde, Stephen Fickas - SCIENCE OF COMPUTER PROGRAMMING , 1993
"... Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages, such as goal ..."
Abstract - Cited by 572 (17 self) - Add to MetaCart
processes then correspond to particular ways of traversing the meta-model graph to acquire approp...
Next 10 →
Results 1 - 10 of 843,300
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