• 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 74,685
Next 10 →

Principles and Practice in Second Language Acquisition

by Stephen D Krashen , 1982
"... This is the original version of Principles and Practice, as published in 1982, with only minor changes. It is gratifying to point out that many of the predictions made in this book were confirmed by subsequent research, for example, the superiority of comprehensible-input based methods and sheltered ..."
Abstract - Cited by 775 (4 self) - Add to MetaCart
This is the original version of Principles and Practice, as published in 1982, with only minor changes. It is gratifying to point out that many of the predictions made in this book were confirmed by subsequent research, for example, the superiority of comprehensible-input based methods

Inverse Acoustic and Electromagnetic Scattering Theory, Second Edition

by David Colton , 1998
"... Abstract. This paper is a survey of the inverse scattering problem for time-harmonic acoustic and electromagnetic waves at fixed frequency. We begin by a discussion of “weak scattering ” and Newton-type methods for solving the inverse scattering problem for acoustic waves, including a brief discussi ..."
Abstract - Cited by 1061 (45 self) - Add to MetaCart
Abstract. This paper is a survey of the inverse scattering problem for time-harmonic acoustic and electromagnetic waves at fixed frequency. We begin by a discussion of “weak scattering ” and Newton-type methods for solving the inverse scattering problem for acoustic waves, including a brief

Maximum Likelihood Phylogenetic Estimation from DNA Sequences with Variable Rates over Sites: Approximate Methods

by Ziheng Yang - J. Mol. Evol , 1994
"... Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called ..."
Abstract - Cited by 557 (29 self) - Add to MetaCart
, and four such categories appear to be sufficient to produce both an optimum, or near-optimum fit by the model to the data, and also an acceptable approximation to the continuous dis- tribution. The second method, called "fixed-rates mod- el," classifies sites into several classes according

Unified analysis of discontinuous Galerkin methods for elliptic problems

by Douglas N. Arnold, Franco Brezzi, Bernardo Cockburn, L. Donatella Marini - SIAM J. Numer. Anal , 2001
"... Abstract. We provide a framework for the analysis of a large class of discontinuous methods for second-order elliptic problems. It allows for the understanding and comparison of most of the discontinuous Galerkin methods that have been proposed over the past three decades for the numerical treatment ..."
Abstract - Cited by 525 (31 self) - Add to MetaCart
Abstract. We provide a framework for the analysis of a large class of discontinuous methods for second-order elliptic problems. It allows for the understanding and comparison of most of the discontinuous Galerkin methods that have been proposed over the past three decades for the numerical

Symmetry and Related Properties via the Maximum Principle

by B. Gidas, Wei-ming Ni, L. Nirenberg , 1979
"... We prove symmetry, and some related properties, of positive solutions of second order elliptic equations. Our methods employ various forms of the maximum principle, and a device of moving parallel planes to a critical position, and then showing that the solution is symmetric about the limiting plan ..."
Abstract - Cited by 538 (4 self) - Add to MetaCart
We prove symmetry, and some related properties, of positive solutions of second order elliptic equations. Our methods employ various forms of the maximum principle, and a device of moving parallel planes to a critical position, and then showing that the solution is symmetric about the limiting

A review of image denoising algorithms, with a new one

by A. Buades, B. Coll, J. M. Morel - SIMUL , 2005
"... The search for efficient image denoising methods is still a valid challenge at the crossing of functional analysis and statistics. In spite of the sophistication of the recently proposed methods, most algorithms have not yet attained a desirable level of applicability. All show an outstanding perf ..."
Abstract - Cited by 508 (6 self) - Add to MetaCart
and, second, to propose a nonlocal means (NL-means) algorithm addressing the preservation of structure in a digital image. The mathematical analysis is based on the analysis of the “method noise, ” defined as the difference between a digital image and its denoised version. The NL-means algorithm

Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces

by Lydia Kavraki, Petr Svestka, Jean-claude Latombe, Mark Overmars - IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION , 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collision-free configurations and whose edg ..."
Abstract - Cited by 1277 (120 self) - Add to MetaCart
A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collision-free configurations and whose

A tutorial on hidden Markov models and selected applications in speech recognition

by Lawrence R. Rabiner - PROCEEDINGS OF THE IEEE , 1989
"... Although initially introduced and studied in the late 1960s and early 1970s, statistical methods of Markov source or hidden Markov modeling have become increasingly popular in the last several years. There are two strong reasons why this has occurred. First the models are very rich in mathematical s ..."
Abstract - Cited by 5892 (1 self) - Add to MetaCart
structure and hence can form the theoretical basis for use in a wide range of applications. Sec-ond the models, when applied properly, work very well in practice for several important applications. In this paper we attempt to care-fully and methodically review the theoretical aspects of this type

Optimal Brain Damage

by Yann Le Cun, John S. Denker, Sara A. Sola , 1990
"... We have used information-theoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved sp ..."
Abstract - Cited by 510 (5 self) - Add to MetaCart
speed of learning and/or classification. The basic idea is to use second-derivative information to make a tradeoff between network complexity and training set error. Experiments confirm the usefulness of the methods on a real-world application.

Face Recognition: A Literature Survey

by W. Zhao, R. Chellappa, P. J. Phillips, A. Rosenfeld , 2000
"... ... This paper provides an up-to-date critical survey of still- and video-based face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an up-to-date review of the existing literature, and the second is to offer some insights into ..."
Abstract - Cited by 1398 (21 self) - Add to MetaCart
... This paper provides an up-to-date critical survey of still- and video-based face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an up-to-date review of the existing literature, and the second is to offer some insights
Next 10 →
Results 1 - 10 of 74,685
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