Sciweavers

664 search results - page 37 / 133
» Some results for a class of generalized polynomials
Sort
View
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
14 years 4 months ago
Multichannel small-gain theorems for large scale networked systems
We consider large scale interconnected systems where some of the interconnections are characterized by uncertain bounded delays. The delays may for instance be due to a communicati...
Rudolf Sailer, Fabian Wirth
ACID
2006
236views Algorithms» more  ACID 2006»
14 years 11 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
DCC
2006
IEEE
15 years 9 months ago
A New Characterization of Semi-bent and Bent Functions on Finite Fields*
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
Khoongming Khoo, Guang Gong, Douglas R. Stinson
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 1 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
ICFP
2006
ACM
15 years 9 months ago
Modular generic programming with extensible superclasses
"Generics for the Masses" (GM) and "Scrap your Boilerplate" (SYB) are generic programming approaches based on some ingenious applications of Haskell type class...
Martin Sulzmann, Meng Wang