Sciweavers

2740 search results - page 83 / 548
» Approximating Component Selection
Sort
View
JUCS
2007
96views more  JUCS 2007»
14 years 9 months ago
Constant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions
At Eurocrypt 2005, Boneh, Boyen and Goh presented a constant size ciphertext hierarchical identity based encryption (HIBE) protocol. Our main contribution is to present a variant ...
Sanjit Chatterjee, Palash Sarkar
ICML
2006
IEEE
15 years 3 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
ICASSP
2010
IEEE
14 years 10 months ago
Approximate eigenvalue decomposition of para-Hermitian systems through successive FIR paraunitary transformations
The eigenvalue decomposition (EVD) of a Hermitian matrix in terms of unitary matrices is well known. In this paper, we present an algorithm for the approximate EVD (AEVD) of a par...
Andre Tkacenko
CDC
2010
IEEE
186views Control Systems» more  CDC 2010»
14 years 4 months ago
Approximation and limiting behavior of random models
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
Behrouz Touri, Angelia Nedic
SIAMJO
2011
14 years 4 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein