Sciweavers

298 search results - page 3 / 60
» ideal 2010
Sort
View
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
13 years 9 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
CDC
2010
IEEE
111views Control Systems» more  CDC 2010»
13 years 5 days ago
Retrospective cost adaptive control for nonminimum-phase discrete-time systems, part 1: The ideal controller and error system
We present a direct adaptive controller for discrete-time (and thus sampled-data) systems that are possibly nonminimum phase. The adaptive control algorithm requires limited model ...
Jesse B. Hoagg, Dennis S. Bernstein
TCC
2010
Springer
176views Cryptology» more  TCC 2010»
14 years 2 months ago
Ideal Hierarchical Secret Sharing Schemes
The search of efficient constructions of ideal secret sharing schemes for families of nonthreshold access structures that may have useful applications has attracted a lot of atten...
Oriol Farràs, Carles Padró
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 5 months ago
CAT-generation of ideals
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Torsten Ueckerdt
HYBRID
2010
Springer
13 years 12 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan