Sciweavers

3116 search results - page 76 / 624
» Recovering
Sort
View
AUTOMATICA
2006
68views more  AUTOMATICA 2006»
13 years 8 months ago
State and unknown input estimation for linear discrete-time systems
: This paper deals with a new type of estimator for discrete-time linear systems with unknown inputs. A constructive algorithm is given in order to analyze the state observability ...
Thierry Floquet, Jean-Pierre Barbot
COMBINATORICS
2007
81views more  COMBINATORICS 2007»
13 years 7 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen
JCB
2006
67views more  JCB 2006»
13 years 7 months ago
The Identifiability of Tree Topology for Phylogenetic Models, Including Covarion and Mixture Models
For a model of molecular evolution to be useful for phylogenetic inference, the topology of evolutionary trees must be identifiable. That is, from a joint distribution the model p...
Elizabeth S. Allman, John A. Rhodes
JOC
2007
81views more  JOC 2007»
13 years 7 months ago
Theoretical Cryptanalysis of the Klimov-Shamir Number Generator TF-1
The internal state of the Klimov–Shamir number generator TF-1 consists of four words of size w bits each, whereas its intended strength is 22w. We exploit an asymmetry in its out...
Boaz Tsaban
APPML
2004
76views more  APPML 2004»
13 years 7 months ago
Between quasi-convex and convex set-valued mappings
Abstract. The aim of this paper is to give sufficient conditions for a quasiconvex setvalued mapping to be convex. In particular, we recover several known characterizations of conv...
J. Benoist, N. Popovici