Sciweavers

530 search results - page 3 / 106
» Universal randomized switching
Sort
View
FOCS
2003
IEEE
15 years 2 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
ICASSP
2011
IEEE
14 years 1 months ago
Factor graph switching portfolios under transaction costs
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Andrew J. Bean, Andrew C. Singer
CDC
2009
IEEE
181views Control Systems» more  CDC 2009»
15 years 2 months ago
Stability of switched linear systems and the convergence of random products
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
Ning Wang, Magnus Egerstedt, Clyde F. Martin
NETWORKING
2000
14 years 11 months ago
An Interworking Call Control Solution for a Multidiscipline Switch
The development of multimedia services is pushing networking technologies towards broadband solutions. A lot of research and development effort has been spent on finding a universa...
Pertti Raatikainen, Sami Raatikainen
FOCS
2002
IEEE
15 years 2 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer