Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
Prefix sum
Known as:
Prefix sums
In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers x0, x1, x2, ... is a second sequence of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
Adder (electronics)
All nearest smaller values
Array data structure
C++
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Constraint-Based Measures for DNA Sequence Mining using Group Search Optimization Algorithm
Kuruva Lakshmanna
,
Neelu Khare
2016
Corpus ID: 35857575
In this paper, we propose a 3-step DNA sequence mining algorithm, called 3s-DNASM, incorporating prefix span, length and width…
Expand
2013
2013
K-Means for Parallel Architectures Using All-Prefix-Sum Sorting and Updating Steps
Kai J. Kohlhoff
,
V. Pande
,
R. Altman
IEEE Transactions on Parallel and Distributed…
2013
Corpus ID: 206770809
We present an implementation of parallel K-means clustering, called Kps-means, that achieves high performance with near-full…
Expand
2013
2013
A Fast Implementation of Parallel Discrete-Event Simulation on GPGPU
Janche Sang
,
Che-Rung Lee
,
V. Rego
,
C. King
2013
Corpus ID: 9757910
Modern General Purpose Graphics Processing Units(GPGPUs) offer much more computational power than recent CPUs by providing a vast…
Expand
2009
2009
Cell-Probe Lower Bounds for Prefix Sums
Emanuele Viola
Electron. Colloquium Comput. Complex.
2009
Corpus ID: 1038442
We prove that to store n bits x so that each prefix-sum query Sum(i) := sum_{k n + n/log^{O(q)} n. Our bound matches a recent…
Expand
2008
2008
Probabilistic Analysis of Cellular Automata Rules and its Application in Pseudo Random Pattern Generation
A. Seth
,
S. Bandyopadhyay
,
U. Maulik
2008
Corpus ID: 10559948
The present work is an extension of the work that appeared in the article titled "Pseudoran- dom Pattern Generation by a 4…
Expand
2006
2006
Spatio-temporal data warehouses using an adaptive cell-based approach
Wonik Choi
,
Dongseop Kwon
,
Sangjun Lee
Data & Knowledge Engineering
2006
Corpus ID: 31949679
Highly Cited
1998
Highly Cited
1998
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors
Jie Wu
IEEE Trans. Parallel Distributed Syst.
1998
Corpus ID: 12941596
Reliable communication in cube-based multicomputers using the safety vector concept is studied in this paper. In our approach…
Expand
1997
1997
From algorithm parallelism to instruction-level parallelism: an encode-decode chain using prefix-sum
U. Vishkin
ACM Symposium on Parallelism in Algorithms and…
1997
Corpus ID: 15796449
From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum
1996
1996
Computing Moments by Prefix Sums
Feng Zhou
,
Peter Kornerup
Proceedings of IEEE international conference on…
1996
Corpus ID: 28626953
AbstractMoments of images are widely used in pattern recognition, because in suitable form they can be made invariant to…
Expand
1995
1995
Prefix-Sums Algorithms on Reconfigurable Meshes
K. Nakano
Parallel Processing Letters
1995
Corpus ID: 34540097
This paper shows that the prefix-sums of n binary values can be computed in $O (\log n /\sqrt{m\log m} +\log \log n)$ time on an…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE