Sciweavers

1059 search results - page 85 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
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
ICIP
2004
IEEE
15 years 11 months ago
Robust perceptual image hashing via matrix invariants
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
Mehmet Kivanç Mihçak, Ramarathnam Ve...
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
13 years 6 days ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
PODS
2009
ACM
110views Database» more  PODS 2009»
15 years 10 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
15 years 10 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais