Sciweavers

1670 search results - page 21 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
PPOPP
2012
ACM
12 years 4 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
PVLDB
2008
82views more  PVLDB 2008»
13 years 8 months ago
Mining non-redundant high order correlations in binary data
Many approaches have been proposed to find correlations in binary data. Usually, these methods focus on pair-wise correlations. In biology applications, it is important to find co...
Xiang Zhang, Feng Pan, Wei Wang 0010, Andrew B. No...
EDBT
2012
ACM
395views Database» more  EDBT 2012»
11 years 10 months ago
Data management with SAPs in-memory computing engine
We present some architectural and technological insights on SAP’s HANA database and derive research challenges for future enterprise application development. The HANA database m...
Joos-Hendrik Boese, Cafer Tosun, Christian Mathis,...
IPPS
2005
IEEE
14 years 2 months ago
A Parallel Algorithm for Correlating Event Streams
This paper describes a parallel algorithm for correlating or “fusing” streams of data from sensors and other sources of information. The algorithm is useful for applications w...
Daniel M. Zimmerman, K. Mani Chandy
CVPR
2010
IEEE
1192views Computer Vision» more  CVPR 2010»
14 years 4 months ago
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
Yigang Peng, Arvind Balasubramanian, John Wright, ...