Books Books
Thus the time complexity of the algorithm is O(n) where n is the number of posts in a given configuration.
Data Mining, Southeast Asia Edition - Page 414
by Jiawei Han, Jian Pei, Micheline Kamber - 2006 - 800 pages

## Graphics Gems V (IBM Version)

Alan W. Paeth - 1995 - 438 pages
...algorithm (Bresenham 1965). Only integer arithmetic is required in the reconstruction process, and the time complexity of the algorithm is O(N), where N is the number of raster edges in the given image. The efficiency of the algorithm makes it useful as a preprocessing...

## Information Modelling and Knowledge Bases X

Hannu Jaakkola, Hannu Kangassalo, Eiji Kawaguchi - 1999 - 351 pages
...scope limit for an identifier ye I in the path from x to x', remove y from I. 7. Go to step 2. The time complexity of the algorithm is O(n), where n is the number of concepts in the schema. The conceptual schema can be stored so that fmding an identifier for a concept...

## Computational Partial Differential Equations: Numerical Methods and Diffpack ...

Hans Petter Langtangen - 2003 - 862 pages
...perhaps most attractive feature of multigrid is that one can prove for many model problems that the complexity of the algorithm is O(n), where n is the number of unknowns in the system [148]. Moreover, the LMG algorithm can be slightly modified and then applied...

## Networking 2005 Networking Technologies, Services, And Protocols ...

Raouf Boutaba, Kevin Almeroth, Ramon Puigjaner, James P. Black, Sherman Shen - 2005 - 1483 pages
...DT limits the complexity of implementation, by considering a packet that is late by DT to be lost. The computation complexity of the algorithm is O(N), where N is the number of packets in the sequence. The memory requirement for the implementation is proportional to DT. The use...

## Advanced Parallel Processing Technologies: 6th International Workshop, APPT ...

Jiannong Cao - 2005 - 526 pages
...lastly, the corresponding loop-carried data dependence edges crossing thread's boundary can be found. The complexity of the algorithm is O(n), where n is the number of program's statements. 4.2 The Improvement of Slicing Algorithm The root cause of the impreciseness...

## Functional Verification of Programmable Embedded Architectures: A Top-Down ...

Prabhat Mishra, Nikil D. Dutt - 2005 - 180 pages
...the input lists, and it reports them. Each node of the graph is visited only once. The time and space complexity of the algorithm is O(n), where n is the number of nodes in the graph G. Each node of the graph can be either unit or storage. Algorithm 1 : Verify Connectedness...