Sciweavers

93 search results - page 4 / 19
» Analyzing Non-Interference with respect to Classes
Sort
View
JHSN
2000
92views more  JHSN 2000»
13 years 6 months ago
On a class of time varying shapers with application to the renegotiable variable bit rate service
A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper i...
Silvia Giordano
GLOBECOM
2007
IEEE
14 years 1 months ago
Contraction Approach to Power Control, with Non-Monotonic Applications
Abstract—In wireless networks, monotonic, strictly subhomogeneous functions have been used to analyze power control algorithms. We provide an alternative analysis based on the ob...
Carl J. Nuzman
COLT
2000
Springer
13 years 11 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
QEST
2010
IEEE
13 years 4 months ago
Reasoning about MDPs as Transformers of Probability Distributions
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
Vijay Anand Korthikanti, Mahesh Viswanathan, Gul A...
CCS
2006
ACM
13 years 10 months ago
Provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Fe...