نتایج جستجو برای: tree like structure

تعداد نتایج: 2241874  

Journal: :CoRR 2016
Kyle Headley Matthew A. Hammer

We introduce the Random Access Zipper (RAZ), a simple, purely-functional data structure for editable sequences. The RAZ combines the structure of a zipper with that of a tree: like a zipper, edits at the cursor require constant time; by leveraging tree structure, relocating the edit cursor in the sequence requires log time. While existing data structures provide these time bounds, none do so wi...

2016
Ming Li Hongbo Cheng Ping Guo Chun Zhang Song Tang Shusheng Wang

BACKGROUND Iris plays important roles in ocular physiology and disease pathogenesis. Currently it is technically challenging to noninvasively examine the human iris ultrastructure in vivo. The purpose of the current study is to reveal human iris ultrastructure in patients with synechiae by using noninvasive in vivo laser scanning confocal microscopy (LSCM). METHODS The ultrastructure of iris ...

Journal: :Annals of Pure and Applied Logic 2015

Journal: :RAIRO - Theoretical Informatics and Applications 2011

Journal: :Electronic proceedings in theoretical computer science 2022

Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem has received significant attention the consistency problem: under which conditions are justifications for a fact and its negation suitably related. Two variants justification exist: one in trees they graphs. In this work we resolve once all tree-like setting by ...

Journal: :Discussiones Mathematicae Graph Theory 2003

2006
Andi Wu Kirk Lowery

In the Masoretic text of the Hebrew Bible (HB), the cantillation marks function like a punctuation system that shows the division and subdivision of each verse, forming a tree structure which is similar to the prosodic tree in modern linguistics. However, in the Masoretic text, the structure is hidden in a complicated set of diacritic symbols and the rich information is accessible only to a few...

Journal: :journal of advances in computer research 2016
mohammad karim sohrabi hamidreza hasannejad marzooni

finding frequent patterns plays a key role in exploring association patterns, correlation, and many other interesting relationships that are applicable in tdb. several association rule mining algorithms such as apriori, fp-growth, and eclat have been proposed in the literature. fp-growth algorithm construct a tree structure from transaction database and recursively traverse this tree to extract...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید