Sciweavers

494 search results - page 40 / 99
» Heap Building Bounds
Sort
View
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
14 years 6 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
JGO
2011
149views more  JGO 2011»
14 years 6 months ago
A logarithmic-quadratic proximal point scalarization method for multiobjective programming
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map...
Ronaldo Gregório, Paulo Roberto Oliveira
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
15 years 5 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
ISW
2009
Springer
15 years 5 months ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner
CSFW
2007
IEEE
15 years 5 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...