Results 1  10
of
208
Sparse signal reconstruction from limited data using FOCUSS: A reweighted minimum norm algorithm
 IEEE TRANS. SIGNAL PROCESSING
, 1997
"... We present a nonparametric algorithm for finding localized energy solutions from limited data. The problem we address is underdetermined, and no prior knowledge of the shape of the region on which the solution is nonzero is assumed. Termed the FOcal Underdetermined System Solver (FOCUSS), the algor ..."
Abstract

Cited by 368 (22 self)
 Add to MetaCart
), the algorithm has two integral parts: a lowresolution initial estimate of the real signal and the iteration process that refines the initial estimate to the final localized energy solution. The iterations are based on weighted norm minimization of the dependent variable with the weights being a function
A Proof of the Kahn Principle for Input/Output Automata
, 1989
"... this paper, we prove the consistency of the Kahn principle with respect to an operational model based on the "input/output automata" of Lynch and Tuttle (1987). Our proof shares with others the four central ideas listed above but has the advantage of being extremely simple (the simples ..."
Abstract

Cited by 63 (7 self)
 Add to MetaCart
this paper, we prove the consistency of the Kahn principle with respect to an operational model based on the "input/output automata" of Lynch and Tuttle (1987). Our proof shares with others the four central ideas listed above but has the advantage of being extremely simple (the
AUTOMATA, REPRESENTATIONS, AND PROOFS
, 2009
"... In this dissertation, we study automata, languages, and functions between automata which preserve the language accepted. We examine them from the perspectives of representation theory, category theory, and proof theory. A central theme is that these perspectives interact in many useful, interesting ..."
Abstract
 Add to MetaCart
In this dissertation, we study automata, languages, and functions between automata which preserve the language accepted. We examine them from the perspectives of representation theory, category theory, and proof theory. A central theme is that these perspectives interact in many useful
Using the Groebner basis algorithm to find proofs of unsatisfiability
, 1996
"... A propositional proof system can be viewed as a nondeterministic algorithm for the (coNP complete) unsatisfiability problem. Many such proof systems, such as resolution, are also used as the basis for heuristics which deterministically search for short proofs in the system. We discuss a propositio ..."
Abstract

Cited by 118 (5 self)
 Add to MetaCart
A propositional proof system can be viewed as a nondeterministic algorithm for the (coNP complete) unsatisfiability problem. Many such proof systems, such as resolution, are also used as the basis for heuristics which deterministically search for short proofs in the system. We discuss a
Lambek calculus proofs and tree automata
 Logical Aspects of Computational Linguistics Third International Conference, LACL '98, Selected Papers, volume 2014 of Lecture Notes in Artificial Intelligence
, 2001
"... Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based on the La ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based
On the Power of Automata Based Proof Systems
, 1999
"... One way to address the NP = co  NP question is to consider the length of proofs of tautologies in various proof systems. In this work we consider proof systems defined by appropriate classes of automata. In general, starting from a given class of automata we can define a corresponding proof syste ..."
Abstract
 Add to MetaCart
One way to address the NP = co  NP question is to consider the length of proofs of tautologies in various proof systems. In this work we consider proof systems defined by appropriate classes of automata. In general, starting from a given class of automata we can define a corresponding proof
Statistical mechanics of probabilistic cellular automata
 J. Stat. Phys
, 1990
"... We investigate the behavior of discretetime probabilistic cellular automata (PCA), which are Markov processes on spin configurations on a ddimensional lattice, from a rigorous statistical mechanics point of view. In particular, we exploit, whenever possible, the correspondence between stationary m ..."
Abstract

Cited by 66 (20 self)
 Add to MetaCart
We investigate the behavior of discretetime probabilistic cellular automata (PCA), which are Markov processes on spin configurations on a ddimensional lattice, from a rigorous statistical mechanics point of view. In particular, we exploit, whenever possible, the correspondence between stationary
Abstract On the Power of Automata Based Proof Systems
"... One way to address the NP = co − NP question is to consider the length of proofs of tautologies in various proof systems. In this work we consider proof systems defined by appropriate classes of automata. In general, starting from a given class of automata we can define a corresponding proof system ..."
Abstract
 Add to MetaCart
One way to address the NP = co − NP question is to consider the length of proofs of tautologies in various proof systems. In this work we consider proof systems defined by appropriate classes of automata. In general, starting from a given class of automata we can define a corresponding proof system
A ProofTheoretic Approach to Logic Programming I
 Generalized Horn Clauses, SICS Research Report, 1987; also in J. of Logic and Computation
, 1987
"... In this paper definite Horn clause programs are investigated within a prooftheoretic framework; program clauses being considered rules of a formal system. Based on this approach, the soundness and completeness of SLDresolution is established by purely prooftheoretic methods. Extended Horn clauses ..."
Abstract

Cited by 76 (10 self)
 Add to MetaCart
In this paper definite Horn clause programs are investigated within a prooftheoretic framework; program clauses being considered rules of a formal system. Based on this approach, the soundness and completeness of SLDresolution is established by purely prooftheoretic methods. Extended Horn
Weighted automata algorithms
 Handbook of Weighted Automata, chapter 6
, 2009
"... This chapter presents several fundamental algorithms for weighted automata and transducers. While the mathematical counterparts of weighted transducers, rational power series, have been extensively studied in the past [22, 54, 13, 36], several essential weighted transducer algorithms, e.g., composit ..."
Abstract

Cited by 30 (5 self)
 Add to MetaCart
This chapter presents several fundamental algorithms for weighted automata and transducers. While the mathematical counterparts of weighted transducers, rational power series, have been extensively studied in the past [22, 54, 13, 36], several essential weighted transducer algorithms, e
Results 1  10
of
208