Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we propose a 3-step DNA sequence mining algorithm, called 3s-DNASM, incorporating prefix span, length and width… 
2013
2013
We present an implementation of parallel K-means clustering, called Kps-means, that achieves high performance with near-full… 
2009
2009
  • Emanuele Viola
  • 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… 
2008
2008
The present work is an extension of the work that appeared in the article titled "Pseudoran- dom Pattern Generation by a 4… 
2002
2002
  • E. Santos
  • 2002
  • Corpus ID: 206573679
The problem of designing efficient parallel algorithms for summing and prefix summing for certain classes of the LogP model is… 
Highly Cited
1998
Highly Cited
1998
  • Jie Wu
  • 1998
  • Corpus ID: 12941596
Reliable communication in cube-based multicomputers using the safety vector concept is studied in this paper. In our approach… 
1997
1997
From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum 
1996
1996
AbstractMoments of images are widely used in pattern recognition, because in suitable form they can be made invariant to… 
1995
1995
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…