2520 search results - page 248 / 504 » The complexity of approximating entropy |
177
click to vote
SIGMOD
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
191
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
435
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
177
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
182
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effec...