O(n log n) algorithm
Towards a practical O(n logn) phylogeny algorithm
... phylogeny algorithm that has O(n log n) runtime with high probability, which is asymptotically ...Our algorithm has high probability of returning the correct phylogeny when ...
10
An $O(k^3\log n)$-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
... k O(k 2 ) log 4 n-approximation algorithm for the ...an O(k O(k) log n)-approximation by Chekuri and Korula [4], and to an O(k 2 log ...
13
A Polar Code Successive Cancellation Decoder Implimentation through a Combinational Logic Circuit
... This algorithm uses beam search method for exploring the possible decoding paths ...greedy algorithm that approaches ML performance with sufficiently large list size, ...SCL algorithm has a ...
7
Research on an Algorithm of the Acceptable Shortest Path
... m n , where is the functional inverse of the Ackermann function [5]; In 2004, Li Yinzhen and Guo Yaohuang gave a sub-tree connectivity algorithm to find the vital edge of the shortest path with time ...
8
A stitch in time: Efficient computation of genomic DNA melting bubbles
... to Algorithm 1's output. Algorithm 1 was simply ...complexity O(N log N), which is the same as computing melting profiles with the Poland-Fixman-Freire algorithm ...
20
A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs
... O n time with O n ( log n ) processors on an EREW PRAM computation model using only parallel prefix computation [23] and Brent’s scheduling principle [24] without using a ...
8
Energy efficient MCDS algorithm for MANETs based on convex hulls
... of O(n 2 ), message complexity of O(n 2 ) and cardinality is at most ...of O(n 2 ). Dai et al. [5] proposed a subtraction based CDS algorithm that consists of two ...of ...
13
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
... randomized algorithm with running time O(n log n log log n) using O(n log n log log n) ...fastest algorithm ...
10
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
... an O(log n) approximation ratio has long been known for ATSP, the best known ratio for ATSPP is O( √ ...time algorithm for ATSPP that has an approximation ratio of O(log ...
13
Hash Tables with Pseudorandom Global Order
... proposed algorithm is not using the sorting given by the value of the key but the hash of the ...of O(log(n)), when done right, and an average complexity of O(log(log((1 − ...
6
An Oblivious Parallel RAM with $O(\log^2 N)$ Parallel Runtime Blowup
... of N data blocks, each of size B bits, on the server, and can also store a small amount of data ...ORAM algorithm can be viewed as a sequence of logical accesses Access(op i , addr i , v i 0 ...
12
Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded
... best algorithm in the literature. How- ever, in many cases R = o(gN ), and our algorithm would show superior behaviour in these ...gN/ log(log(g)), LCS_RLE-II will out- perform the best ...
8
Parallel O(log(n)) time edge colouring of trees and Halin graphs
... Algorithm EDGECOLOUR; [the algorithm edge colours Hahn graphs with 0=3 Step 0 Using the Euler tour technique [13] root the tree T at a vertex root of distance one from C... Colour the ed[r] ...
17
A versatile, linear complexity algorithm for flow routing in topographies with depressions
... resolution algorithm – we use here an optimal O(n) algorithm proposed by Barnes et ...our algorithm, we thus need to run them on a temporary copy of the elevation values before ...
14
Behavior of O(log n) Local Commuting Hamiltonians
... scales O (| ∂A |) , where | ∂A | is the size of the boundary of ...first algorithm that works for all systems in ...quantum algorithm? This was the main motivation to consider the area law for ...
33
An efficient high dimensional quantum Schur transform
... efficient algorithm for a high dimensional Schur transform that runs in time O(poly(n, log d, log ...in log d. Our algorithm is novel in that it uses the representation ...
21
Computation of Geographic Location with the Aid of Geospatial Images
... an algorithm which is based on Prim’s ...Prim’s algorithm even this algorithm uses a single priority ...this algorithm, when a component stops growing the new source is set to the vertex with ...
5
N,N Dimethyl N′ (o fluorobenzoyl)hydrazide
... The presence of the ortho-fluoro substituent causes (I) to adopt a conformation (Fig. 1) which precludes conjugation across the C6—C7 bond [C1—C6—C7—N1 = 122.5 (2)°]. Possibly as a result, the C6—C7 bond [1.509 (2) Å] is ...
9
Improved sorting networks with O(log n) depth
... In our most basic scheme this is done by partitioning the bag of elements at each node into four parts: the main left and right 'halves', which are sent down to the daughter bags, and in[r] ...
23
Designs of Second-Order Associated Memory Networks with Threshold Logics: Winner-Take-All and Selective Voting
... with N multiplexers and one N -input accumulator (shown as N-AC in the ...with N − 1 adders of at most log 2 N ...with N multiplexers and one N -input ...
13