Results 11 - 20 of 20,134

Focusing the Inverse Method for Linear Logic

by unknown authors
"... Focusing is traditionally seen as a means of reducing inessential non-determinism in backward-reasoning strategies such as uniform proof-search or tableaux systems. In this paper we construct a form of focused derivations for propositional linear logic that is appropriate for forward reasoning in th ..."
Abstract - Add to MetaCart
in the inverse method. We show that the focused inverse method conservatively generalises the classical hyperresolution strategy for Horn-theories, and demonstrate through a practical implementation that the focused inverse method is considerably faster than the non-focused version. 1.

A fast iterative shrinkage-thresholding algorithm with application to . . .

by Amir Beck, Marc Teboulle , 2009
"... We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast Iterat ..."
Abstract - Cited by 1058 (9 self) - Add to MetaCart
We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast

SIGNAL RECOVERY BY PROXIMAL FORWARD-BACKWARD SPLITTING

by Patrick L. Combettes, Valérie R. Wajs - MULTISCALE MODEL. SIMUL. TO APPEAR
"... We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a unifi ..."
Abstract - Cited by 509 (24 self) - Add to MetaCart
We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a

NewsWeeder: Learning to Filter Netnews

by Ken Lang - in Proceedings of the 12th International Machine Learning Conference (ML95 , 1995
"... A significant problem in many information filtering systems is the dependence on the user for the creation and maintenance of a user profile, which describes the user's interests. NewsWeeder is a netnews-filtering system that addresses this problem by letting the user rate his or her interest l ..."
Abstract - Cited by 561 (0 self) - Add to MetaCart
level for each article being read (1-5), and then learning a user profile based on these ratings. This paper describes how NewsWeeder accomplishes this task, and examines the alternative learning methods used. The results show that a learning algorithm based on the Minimum Description Length (MDL

Toward a model of text comprehension and production

by Walter Kintsch, Teun A. Van Dijk - Psychological Review , 1978
"... The semantic structure of texts can be described both at the local microlevel and at a more global macrolevel. A model for text comprehension based on this notion accounts for the formation of a coherent semantic text base in terms of a cyclical process constrained by limitations of working memory. ..."
Abstract - Cited by 557 (12 self) - Add to MetaCart
are predictable only when the control schema can be made explicit. On the production side, the model is con-cerned with the generation of recall and summarization protocols. This process is partly reproductive and partly constructive, involving the inverse operation of the macro-operators. The model is applied

K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

by Michal Aharon, et al. , 2006
"... In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signal-atoms, signals are described by sparse linear combinations of these atoms. Applications that use sparse representation are many and inc ..."
Abstract - Cited by 935 (41 self) - Add to MetaCart
and include compression, regularization in inverse problems, feature extraction, and more. Recent activity in this field has concentrated mainly on the study of pursuit algorithms that decompose signals with respect to a given dictionary. Designing dictionaries to better fit the above model can be done

An inverse method for subcritical flows

by K. Daripa - J. Comput. Phys , 1986
"... The inverse problem in the tangent gas approximation is considered. An exact method for designing airfoils is presented. Constraints on the speed distribution are easily implemented. A simple numerical algorithm which is fast and accurate is presented. Comparison of designed airfoils using the tange ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
The inverse problem in the tangent gas approximation is considered. An exact method for designing airfoils is presented. Constraints on the speed distribution are easily implemented. A simple numerical algorithm which is fast and accurate is presented. Comparison of designed airfoils using

Damage identification using inverse methods

by Michael I. Friswell - Special Issue of the Royal Society Philosophical Transactions on Structural Health Monitoring and Damage Prognosis , 2007
"... Abstract This chapter gives an overview of the use of inverse methods in damage detection and location, using measured vibration data. Inverse problems require the use of a model and the identification of uncertain parameters of this model. Damage is often local in nature and although the effect of ..."
Abstract - Cited by 17 (3 self) - Add to MetaCart
Abstract This chapter gives an overview of the use of inverse methods in damage detection and location, using measured vibration data. Inverse problems require the use of a model and the identification of uncertain parameters of this model. Damage is often local in nature and although the effect

Subspace linear inversion methods

by Douglas W Oldenburg, Yaoguo Li - Inverse Problems , 1994
"... Abslract. This paper presents a robust, flexible and efficient algorithm to solve large scale linear inverse problems. The method is iterative and at each iteration a perturbation in a q-dimensional subspace of an M-dimensional model space is sought. The basis vectors for the subspace are primarily ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abslract. This paper presents a robust, flexible and efficient algorithm to solve large scale linear inverse problems. The method is iterative and at each iteration a perturbation in a q-dimensional subspace of an M-dimensional model space is sought. The basis vectors for the subspace are primarily

The inverse method for the logic of bunched implications

by Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, Stephen Magill, Sungwoo Park - In Proceedings of LPAR 2004, volume 3452 of LNAI , 2005
"... Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic with ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic
Results 11 - 20 of 20,134