Sciweavers

1054 search results - page 50 / 211
» Fast Approximated SIFT
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Empirical divergence maximization for quantizer design: An analysis of approximation error
Empirical divergence maximization is an estimation method similar to empirical risk minimization whereby the Kullback-Leibler divergence is maximized over a class of functions tha...
Michael A. Lexa
FOCS
2006
IEEE
15 years 3 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
RT
1999
Springer
15 years 2 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
15 years 10 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
SIAMNUM
2010
134views more  SIAMNUM 2010»
14 years 4 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