Find link

language:

Find link is a tool written by Edward Betts.

searching for Tree traversal 22 found (54 total)

Common Weakness Enumeration (487 words) [view diff] exact match in snippet view article find links to article

categories, including classes for buffer overflows, path/directory tree traversal errors, race conditions, cross-site scripting, hard-coded passwords

JQuery (2,989 words) [view diff] exact match in snippet view article find links to article

jQuery is a JavaScript library designed to simplify HTML DOM tree traversal and manipulation, as well as event handling, CSS animations, and Ajax. It is

Knowledge management software (913 words) [view diff] exact match in snippet view article find links to article

visual search techniques. Some common visual search approaches include: Tree traversal – A folder is opened and inside the display of that folder are further

Hash-based cryptography (2,329 words) [view diff] exact match in snippet view article find links to article

private key is also very small, e.g. typically 32 bytes. The problem of tree traversal is critical to signing performance. Increasingly efficient approaches

Code generation (compiler) (878 words) [view diff] exact match in snippet view article

instruction set of the target machine. This second phase does not require a tree traversal; it can be done linearly, and typically involves a simple replacement

C POSIX library (181 words) [view diff] exact match in snippet view article find links to article

structures Issue 4 <fnmatch.h> Filename matching Issue 4 <ftw.h> File tree traversal Issue 1 <glob.h> Pathname "globbing" (pattern-matching) Issue 4 <grp

XML (7,244 words) [view diff] no match in snippet view article find links to article

APIs accessible from a programming language, for example SAX and StAX. Tree-traversal APIs accessible from a programming language, for example DOM. XML data

Chattr (713 words) [view diff] exact match in snippet view article find links to article

on the command line are followed. (Symbolic links encountered in the tree traversal are not followed.) -L If the -R option is specified, all symbolic links

Bounding interval hierarchy (1,107 words) [view diff] exact match in snippet view article find links to article

slow heuristic to evaluate) The traversal phase closely resembles a kd-tree traversal: One has to distinguish four simple cases, where the ray just intersects

Barnes–Hut simulation (814 words) [view diff] exact match in snippet view article find links to article

interaction kernel for a multitude of applications Parallel GPU N-body simulation program with fast stackless particles tree traversal [1] at beltoforion.de

CEGUI (827 words) [view diff] exact match in snippet view article find links to article

are organized in a tree (graph) and are rendered in the order of the tree traversal. File loading and resource management are handled through a back-end

Dynamic array (2,102 words) [view diff] exact match in snippet view article find links to article

array, in theory and in practice, due to non-contiguous storage and tree traversal/manipulation overhead. Gap buffers are similar to dynamic arrays but

Red–black tree (9,350 words) [view diff] exact match in snippet view article find links to article

nodes is a red–black tree. The read-only operations, such as search or tree traversal, do not affect any of the requirements. In contrast, the modifying operations

NTU RGB-D dataset (363 words) [view diff] exact match in snippet view article find links to article

Spatio-Temporal LSTM with Trust Gates for 3D Human Action Recognition Arranging skeletal joints for tree traversal 77.7 Deep Learning Deep LSTM None 67.3

Integer sorting (4,049 words) [view diff] exact match in snippet view article find links to article

may be sorted recursively using only keys of size b, after which a tree traversal produces the sorted order of the items. Fredman & Willard (1993) introduced

Post-quantum cryptography (6,408 words) [view diff] case mismatch in snippet view article find links to article

Signatures Revisited: Practical Fast Signatures Using Fractal Merkle Tree Traversal" (PDF). IEEE. Retrieved 13 May 2014. Barreto, Paulo S. L. M.; Biasi

Collision detection (4,887 words) [view diff] exact match in snippet view article find links to article

over a set of bounding volumes. Collision is determined by doing a tree traversal starting from the root. If the bounding volume of the root doesn't intersect

Master theorem (analysis of algorithms) (1,978 words) [view diff] exact match in snippet view article

= 1 , b = 2 , c = 0 , k = 0 {\displaystyle a=1,b=2,c=0,k=0} Binary tree traversal T ( n ) = 2 T ( n 2 ) + O ( 1 ) {\displaystyle T(n)=2T\left({\frac

Interval tree (3,577 words) [view diff] exact match in snippet view article find links to article

{center}}} can be added to the results without further processing and tree traversal can be stopped. For a result interval r {\displaystyle r} to intersect

N-body problem (8,730 words) [view diff] exact match in snippet view article find links to article

translations, with discussion [1] Parallel GPU N-body simulation program with fast stackless particles tree traversal Portals: Mathematics Physics Astronomy

Tracing garbage collection (5,282 words) [view diff] exact match in snippet view article find links to article

the collection cycle. The first stage is the mark stage which does a tree traversal of the entire 'root set' and marks each object that is pointed to by

Image segmentation (9,700 words) [view diff] case mismatch in snippet view article find links to article

424–433. S.L. Horowitz and T. Pavlidis, Picture Segmentation by a Tree Traversal Algorithm, Journal of the ACM, 23 (1976), pp. 368–388. L. Chen, The