Sciweavers

4886 search results - page 396 / 978
» Approximate Data Exchange
Sort
View
PODS
2012
ACM
281views Database» more  PODS 2012»
13 years 10 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
ICPR
2008
IEEE
16 years 8 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios
ICML
2005
IEEE
16 years 8 months ago
Near-optimal sensor placements in Gaussian processes
When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at t...
Carlos Guestrin, Andreas Krause, Ajit Paul Singh
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ICASSP
2009
IEEE
16 years 2 months ago
Separable PCA for image classification
As an alternative to standard PCA, matrix-based image dimensionality reduction methods have recently been proposed and have gained attention due to reported computational efficie...
Yongxin Taylor Xi, Peter J. Ramadge