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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

Multi-Pivot Quicksort refers to variants of classical quicksort where in the partitioning step k pivots are used to split the…

2014

2012

In this paper, a new algorithm is presented to compute the disparity map from a stereo pair of images by using Belief Propagation…

2000

In this paper, we describe problems in recognizing large-vocabulary Korean continuous speech, and proposed solutions to them…

1999

We describe a method to perform two-pass 3-D Kirchho prestack time migration whose com- putation time is nearly the square-root…

1998

In this paper we present a speech understanding system that accepts continuous speech sentences as input to command a HIFI set…

1995

A one-pass vector quantizer design algorithm is presented. The algorithm sequentially selects a subset of the training vectors…

Highly Cited

1990

Highly Cited

1990

A method of representing connected components in multivalued images is proposed, and an efficient, sequential, one-pass algorithm…

1975

Data base statistics play an important role in conventional information compression. For a large data base, the acquisition of…

1970

Abstract : The generalized network problem and the closely related restricted dyadic problem occur frequently in applications of…