Sciweavers

441 search results - page 81 / 89
» A Method for Proving Observational Equivalence
Sort
View
ICTAC
2004
Springer
15 years 11 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
AI
1998
Springer
15 years 5 months ago
Reasoning About Actions: Steady Versus Stabilizing State Constraints
In formal approaches to commonsense reasoning about actions. the Ramification Problem denotes the problem of handling indirect effects which implicitly derive from so-called state...
Michael Thielscher
ICASSP
2009
IEEE
16 years 12 days ago
Convex analysis based minimum-volume enclosing simplex algorithm for hyperspectral unmixing
Abstract—Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or abundances) from an observed hyperspect...
Tsung-Han Chan, Chong-Yung Chi, Yu-Min Huang, Wing...
ALMOB
2008
81views more  ALMOB 2008»
15 years 5 months ago
Stability of multiple alignments and phylogenetic trees: an analysis of ABC-transporter proteins family
Background: Sequence-based phylogeny reconstruction is a fundamental task in Bioinformatics. Practically all methods for phylogeny reconstruction are based on multiple alignments....
Holger Wagner, Burkhard Morgenstern, Andreas W. M....
SIAMMAX
2010
164views more  SIAMMAX 2010»
15 years 12 days ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu