Results 221 to 230 of about 532,046 (273)

Profile of Tries

SIAM Journal on Computing, 2008
Tries (from retrieval) are one of the most popular data structures on words. They are pertinent to the (internal) structure of stored words and several splitting procedures used in diverse contexts. The profile of a trie is a parameter that represents the number of nodes (either internal or external) with the same distance from the root.
GaHyun Park   +3 more
openaire   +3 more sources

ON CLIMBING TRIES

Probability in the Engineering and Informational Sciences, 2007
To sample a typical key in a “trie,” an appropriate climbing might consider generating random edges in the same manner as the data are generated. In the absence of the probability generating the keys, an uninformed random choice among the children still provides an alternative.
Christophi, Costas, Mahmoud, Hosam
openaire   +2 more sources

Heights in Generalized Tries and PATRICIA Tries

2000
We consider digital trees such as (generalized) tries and PATRICIA tries, built from n random strings generated by an unbiased memoryless source (i.e., all symbols are equally likely). We study limit laws of the height which is defined as the longest path in such trees.
Charles Knessl, Wojciech Szpankowski
openaire   +1 more source

Tried and tested

Nursing Standard, 1988
Ainna Fawcett-Henesy's letter in response to the Guardian Leader comment, November 26, quite rightly emphasised the positive aspects of the White Paper and The Health Circular on Community Nursing, namely the endorsement of the nurse practitioner and nurse prescribing.
openaire   +2 more sources

Über Tris(siloxymethyl)‐, Tris(silylmercaptomethyl)‐ und Tris(silylmethyl)amine

Helvetica Chimica Acta, 1973
AbstractBy the reaction of alkali salts of triorgano‐silanols, ‐silanethiols and trimethylsilylmethanol as well as of triorganosilyllithium compounds with tris(chloromethyl)amine, silyl derivatives of tris(hydroxymethyl)‐, tris(mercaptomethyl)‐ and tris(methyl)amine were prepared.
openaire   +1 more source

Home - About - Disclaimer - Privacy