Sciweavers

3096 search results - page 345 / 620
» The Generalized FITC Approximation
Sort
View
ICML
2003
IEEE
16 years 7 months ago
TD(0) Converges Provably Faster than the Residual Gradient Algorithm
In Reinforcement Learning (RL) there has been some experimental evidence that the residual gradient algorithm converges slower than the TD(0) algorithm. In this paper, we use the ...
Ralf Schoknecht, Artur Merke
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 6 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
16 years 6 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 6 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
CVPR
2010
IEEE
16 years 2 months ago
Simultaneous Point Matching and 3D Deformable Surface Reconstruction
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...
Appu Shaji, Aydin Varol, Lorenzo Torresani, Pascal...