๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for supertrees

โœ Scribed by Mariana Constantinescu; David Sankoff

Publisher
Springer
Year
1995
Tongue
English
Weight
514 KB
Volume
12
Category
Article
ISSN
0176-4268

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient parallel algorithm for mult
An efficient parallel algorithm for multiselection
โœ S. Olariu; Z. Wen ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

Olariu, S. and Z. Wen, An efficient parallel algorithm for multiselection, Parallel Computing 17 (1991) 689-693. The problem of multiselection arises frequently in databases. Here, given an unordered set S of n records and a sequence of m integers 1 ~< ql < q2 < .--< qm ~< n we are interested in an

An Efficient Algorithm for Minimum-Weigh
An Efficient Algorithm for Minimum-Weight Bibranching
โœ J. Keijsper; R. Pendavingh ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

Given a directed graph D=(V, A) and a set S V, a bibranching is a set of arcs B A that contains a v&(V "S) path for every v # S and an S&v path for every v # V "S. In this paper, we describe a primal dual algorithm that determines a minimum weight bibranching in a weighted digraph. It has running ti

An efficient algorithm for parallel inte
An efficient algorithm for parallel integer multiplication
โœ Benjamin Singer; George Saon ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 67 KB

In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t

An Efficient Randomized Algorithm for De
An Efficient Randomized Algorithm for Detecting Circles
โœ Teh-Chuan Chen; Kuo-Liang Chung ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 444 KB

Detecting circles from a digital image is very important in shape recognition. In this paper, an efficient randomized algorithm (RCD) for detecting circles is presented, which is not based on the Hough transform (HT). Instead of using an accumulator for saving the information of the related paramete