Sciweavers

394 search results - page 24 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
ACSD
2007
IEEE
102views Hardware» more  ACSD 2007»
16 years 15 days ago
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
Franck Cassez, Stavros Tripakis, Karine Altisen
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 6 months ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
JUCS
2007
120views more  JUCS 2007»
15 years 6 months ago
Compile-time Computation of Polytime Functions
: We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechan...
Emanuele Covino, Giovanni Pani, Daniele Scrimieri
UC
2005
Springer
15 years 11 months ago
A Computational Model for Self-assembling Flexible Tiles
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
Natasa Jonoska, Gregory L. McColm
RECOMB
2010
Springer
15 years 4 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...