Sciweavers

4894 search results - page 578 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
130
Voted
ECCC
2007
185views more  ECCC 2007»
15 years 4 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
JSAC
2006
79views more  JSAC 2006»
15 years 4 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
131
Voted
FOCM
2007
94views more  FOCM 2007»
15 years 4 months ago
Trust-Region Methods on Riemannian Manifolds
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
Pierre-Antoine Absil, C. G. Baker, Kyle A. Galliva...
148
Voted
PRL
2008
118views more  PRL 2008»
15 years 4 months ago
A large margin approach for writer independent online handwriting classification
This paper proposes a new approach for classifying multivariate time-series with applications to the problem of writer independent online handwritten character recognition. Each t...
Karthik Kumara, Rahul Agrawal, Chiranjib Bhattacha...
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 4 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller