منابع مشابه
ACCELERATION AND STOCHASTIC HIPPARCOS SOLUTIONS Based on observations made with the ESA Hipparcos satellite
The Hipparcos astrometric parameters were obtained through the merging of abscissae data obtained by FAST and NDAC Consortia. Using a different weighting scheme, close but different astrometric solutions may be obtained. The resulting influence on acceleration (G) and stochastic (X) solutions is discussed; these solutions are studied from the point of view of the possible signature of astrometr...
متن کاملAverage profiles, from tries to suffix-trees
We build upon previous work of Fayolle (2004) and Park and Szpankowski (2005) to study asymptotically the average internal profile of tries and of suffix-trees. The binary keys and the strings are built from a Bernoulli source (p, q). We consider the average number pk,P(ν) of internal nodes at depth k of a trie whose number of input keys follows a Poisson law of parameter ν. The Mellin transfor...
متن کاملHow to salvage a salvage endoprosthesis
Custom-made endoprostheses can be linked to existing well-fixed implants in the treatment of complex periprosthetic femoral fractures. By adopting this salvage approach, secure implants can be retained in favour of patients undergoing more tissue disruptive procedures such as total femoral replacements. In this piece, we present a unique case illustrating a salvage strategy for treating a faile...
متن کاملUncommon Suffix Tries
Common assumptions on the source producing the words inserted in a suffix trie with n leaves lead to a lnn height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of n and another one whose saturation level is negligible with respect to lnn. Both are built from VLMC (Variable Length Markov Chain) probabilistic sources and are easily extende...
متن کاملUpdating Reduced Implicate Tries
The reduced implicate trie, introduced in [11], is a data structure that may be used as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. Specifically, a query can be processed in time linear in the size of the query regardless of the size of the compiled knowledge base. The knowledge compilation paradigm typically as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1989
ISSN: 0028-0836,1476-4687
DOI: 10.1038/340581b0