| 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... | |
| 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... | |
| 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... | |
| Raouf Boutaba, Kevin Almeroth, Ramon Puigjaner, Sherman Shen, James P. Black - 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... | |
| 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... | |
| 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... | |
| Tse, Philip K.C - 2008 - 420 pages
...becomes high. As the algorithm repeats the process at half size to find the victim objects, the time **complexity of the algorithm is O(n), where n is the number of objects** in the cache. When the number of objects in the cache increases, the performance of the algorithm in... | |
| |