Sciweavers

530 search results - page 11 / 106
» Universal randomized switching
Sort
View
100
Voted
SIAMCO
2002
81views more  SIAMCO 2002»
15 years 1 months ago
Stability of Planar Switched Systems: The Linear Single Input Case
Abstract. We study the stability of the origin for the dynamical system x(t) = u(t)Ax(t)+(1u(t))Bx(t), where A and B are two 2
Ugo V. Boscain
IPL
2006
110views more  IPL 2006»
15 years 1 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
118
Voted
COLT
1992
Springer
15 years 6 months ago
Learning Switching Concepts
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
Avrim Blum, Prasad Chalasani
111
Voted
CRYPTO
2003
Springer
93views Cryptology» more  CRYPTO 2003»
15 years 7 months ago
Universal Composition with Joint State
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
Ran Canetti, Tal Rabin
ICCAD
1996
IEEE
151views Hardware» more  ICCAD 1996»
15 years 6 months ago
Expected current distributions for CMOS circuits
The analysis of CMOS VLSI circuit switching current has become an increasingly important and difficult task from both a VLSI design and simulation software perspective. This paper...
Dennis J. Ciplickas, Ronald A. Rohrer