Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,306 papers from all fields of science
Search
Sign In
Create Free Account
One-pass algorithm
In computing, a one-pass algorithm is one which reads its input exactly once, in order, without unbounded buffering. A one-pass algorithm generally…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Algorithms for calculating variance
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Evolving Fuzzy Min–Max Neural Network Based Decision Trees for Data Stream Classification
Z. Mirzamomen
,
M. Kangavari
Neural Processing Letters
2017
Corpus ID: 8884293
Learning from data streams is a challenging task which demands a learning algorithm with several high quality features. In…
Expand
2012
2012
Stereo correspondence using efficient hierarchical belief propagation
Raj Kumar Gupta
,
Siu-Yeung Cho
Neural computing & applications (Print)
2012
Corpus ID: 254037727
In this paper, a new algorithm is presented to compute the disparity map from a stereo pair of images by using Belief Propagation…
Expand
2011
2011
One-pass encoding algorithm for adaptive loop filter in high-efficiency video coding
Chia-Yang Tsai
,
Ching-Yeh Chen
,
Chih-Ming Fu
,
Yu-Wen Huang
,
S. Lei
Visual Communications and Image Processing
2011
Corpus ID: 1986598
In this paper, a one-pass encoding algorithm is proposed for adaptive loop filter (ALF) in high-efficiency video coding (HEVC…
Expand
2011
2011
MEMSA: mining emerging melody structures from music query data
Hua-Fu Li
Multimedia Systems
2011
Corpus ID: 20455638
Effective and efficient mining of music structure patterns from music query data is one of the most interesting issues of…
Expand
2009
2009
One-Pass Algorithm
Nicole Schweikardt
Encyclopedia of Database Systems
2009
Corpus ID: 45546507
A one-pass algorithm receives as input a list of data items x1, x2, x3, . . . . It can read these data items only once, from left…
Expand
2008
2008
Approximate mining of maximal frequent itemsets in data streams with different window models
Hua-Fu Li
,
Suh-Yin Lee
Expert systems with applications
2008
Corpus ID: 45550288
2007
2007
A self-constructing fuzzy CMAC model and its applications
Chi-Yung Lee
,
Cheng‐Jian Lin
,
Huei-Jen Chen
Information Sciences
2007
Corpus ID: 31764986
Highly Cited
1990
Highly Cited
1990
One-pass encoding of connected components in multivalued images
E. Mandler
,
Matthias F. Oberländer
[] Proceedings. 10th International Conference on…
1990
Corpus ID: 54520286
A method of representing connected components in multivalued images is proposed, and an efficient, sequential, one-pass algorithm…
Expand
1987
1987
Dilation algorithm for a linear quadtree
D. Mason
Image and Vision Computing
1987
Corpus ID: 31864629
1983
1983
On translating a set of line segments
T. Ottmann
,
P. Widmayer
Computer Vision Graphics and Image Processing
1983
Corpus ID: 25611689
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
or Only Accept Required