Results 1  10
of
416,332
Stable signal recovery from incomplete and inaccurate measurements,”
 Comm. Pure Appl. Math.,
, 2006
"... Abstract Suppose we wish to recover a vector x 0 ∈ R m (e.g., a digital signal or image) from incomplete and contaminated observations y = Ax 0 + e; A is an n × m matrix with far fewer rows than columns (n m) and e is an error term. Is it possible to recover x 0 accurately based on the data y? To r ..."
Abstract

Cited by 1368 (38 self)
 Add to MetaCart
Abstract Suppose we wish to recover a vector x 0 ∈ R m (e.g., a digital signal or image) from incomplete and contaminated observations y = Ax 0 + e; A is an n × m matrix with far fewer rows than columns (n m) and e is an error term. Is it possible to recover x 0 accurately based on the data y
Robust Uncertainty Principles: Exact Signal Reconstruction From Highly Incomplete Frequency Information
, 2006
"... This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discretetime signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result of this pa ..."
Abstract

Cited by 2585 (50 self)
 Add to MetaCart
This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discretetime signal and a randomly chosen set of frequencies. Is it possible to reconstruct from the partial knowledge of its Fourier coefficients on the set? A typical result
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 866 (14 self)
 Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important
Decoding by Linear Programming
, 2004
"... This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector f ∈ Rn from corrupted measurements y = Af + e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to rec ..."
Abstract

Cited by 1373 (16 self)
 Add to MetaCart
fraction of the output is corrupted. This work is related to the problem of finding sparse solutions to vastly underdetermined systems of linear equations. There are also significant connections with the problem of recovering signals from highly incomplete measurements. In fact, the results introduced
A sequential quadratic programming algorithm using an incomplete solution of the subproblem
 SIAM Journal of Optimization
, 1995
"... Ary opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do NOT necessarily reflect the views of the above sponsors. ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
Ary opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do NOT necessarily reflect the views of the above sponsors.
Inferencing Over Incomplete Solution Spaces with Genetic Algorithms for Probabilistic Reasoning
 Online Proceedings of the 1996 Midwest artificial Intelligence and Cognitive Science Conference., edited by
, 1996
"... We develop a new method for handling incomplete knowledge when inferencing over Bayesian Knowledge Bases(BKB) using genetic algorithms(GA) . The fitness function for a genetic algorithm requires that we give a score to each solution it generates. When a solution is complete, we can use the joint pro ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We develop a new method for handling incomplete knowledge when inferencing over Bayesian Knowledge Bases(BKB) using genetic algorithms(GA) . The fitness function for a genetic algorithm requires that we give a score to each solution it generates. When a solution is complete, we can use the joint
Applying AI and Incomplete Solution Principles to Solve NPhard Problems in the RealTime Systems
"... Abstract: In this paper a question of using artificial intelligence principles and an incomplete solution approach were explored for solving NP hard problems in the realtime systems using the maximum clique finding problem as an example. The incomplete solution is used to analyze different best kn ..."
Abstract
 Add to MetaCart
Abstract: In this paper a question of using artificial intelligence principles and an incomplete solution approach were explored for solving NP hard problems in the realtime systems using the maximum clique finding problem as an example. The incomplete solution is used to analyze different best
Incentives and Incomplete Information
 Journal of Public Economics, XI
, 1979
"... The problem of incentives for correct revelation in a collective decision model is presented as a game with incomplete information. Two approaches to incomplete information are used, a first where the individual beliefs are not introduced and a second where they are. In the first approach it is re ..."
Abstract

Cited by 187 (1 self)
 Add to MetaCart
The problem of incentives for correct revelation in a collective decision model is presented as a game with incomplete information. Two approaches to incomplete information are used, a first where the individual beliefs are not introduced and a second where they are. In the first ap
Incomplete
"... Abstract: Automatic Testing Systems (ATS) have become widely used to assist in fault detection of electronic devices, especially in the field of avionics. These systems have widely varying capabilities, and can range in size from large 6foot racks of equipment to small PCbased testers. Selecting t ..."
Abstract
 Add to MetaCart
Abstract: Automatic Testing Systems (ATS) have become widely used to assist in fault detection of electronic devices, especially in the field of avionics. These systems have widely varying capabilities, and can range in size from large 6foot racks of equipment to small PCbased testers. Selecting the individual systems can be a complex procedure, depending on many variables such as cost, dependability, and transportability. This paper presents an objectoriented knowledgebased approach to making intelligent decisions about the most optimal selection of these testers. It is believed that such an approach could be highly beneficial to organizations that utilize these ATS by helping to save time, money, and other relevant resources.
Results 1  10
of
416,332