Sciweavers

1670 search results - page 36 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
14 years 2 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010
CONEXT
2006
ACM
14 years 2 months ago
Inferring groups of correlated failures
We compare and evaluate different methods to infer groups of correlated failures. These methods try to group failure events occurring nearly simultaneously in clusters. Indeed if...
Jean Lepropre, Guy Leduc
CIKM
2006
Springer
14 years 6 days ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
ICS
2009
Tsinghua U.
14 years 3 months ago
Computer generation of fast fourier transforms for the cell broadband engine
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...
Srinivas Chellappa, Franz Franchetti, Markus P&uum...
ECCV
2010
Springer
13 years 9 months ago
Fast and Exact Primal-Dual Iterations for Variational Problems in Computer Vision
The saddle point framework provides a convenient way to formulate many convex variational problems that occur in computer vision. The framework unifies a broad range of data and re...
Jan Lellmann, Dirk Breitenreicher, Christoph Schn&...