Sciweavers

1021 search results - page 5 / 205
» Fast Approximate PCPs
Sort
View
SIAMNUM
2010
134views more  SIAMNUM 2010»
13 years 2 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts
JCNS
2010
90views more  JCNS 2010»
13 years 2 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
11 years 10 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
PAMI
2012
11 years 10 months ago
Medial Spheres for Shape Approximation
—We study the problem of approximating a 3D solid with a union of overlapping spheres. In comparison with a stateof-the-art approach, our method offers more than an order of magn...
Svetlana Stolpner, Paul G. Kry, Kaleem Siddiqi
SIAMSC
2010
155views more  SIAMSC 2010»
13 years 2 months ago
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
Berkant Savas, Lek-Heng Lim