Sciweavers

1974 search results - page 109 / 395
» On Unbiased Linear Approximations
Sort
View
102
Voted
NIPS
2007
15 years 2 months ago
Random Features for Large-Scale Kernel Machines
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
Ali Rahimi, Benjamin Recht
100
Voted
BMVC
2000
15 years 2 months ago
Building Temporal Models for Gesture Recognition
This work presents a piecewise linear approximation to non-linear Point Distribution Models for modelling the human hand. The work utilises the natural segmentation of shape space...
Richard Bowden, Mansoor Sarhadi
98
Voted
MOC
1998
90views more  MOC 1998»
15 years 12 days ago
Numerical solution of parabolic integro-differential equations by the discontinuous Galerkin method
The numerical solution of a parabolic equation with memory is considered. The equation is first discretized in time by means of the discontinuous Galerkin method with piecewise co...
Stig Larsson, Vidar Thomée, Lars B. Wahlbin
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 4 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
ICCV
2001
IEEE
16 years 2 months ago
Lambertian Reflectance and Linear Subspaces
We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D lin...
Ronen Basri, David W. Jacobs