Search results

Jump to navigation Jump to search
Results 1 – 21 of 302
Advanced search

Search in namespaces:

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • A '''propositional directed acyclic graph (PDAG)''' is a [[data structure]] that is used to represent a [[Boolean function]]. A Boolean fu * [[Data structure]] ...
    3 KB (433 words) - 05:37, 24 March 2025
  • {{Short description|Probabilistic graphical model}} ...d simple dependency models such as [[hidden Markov model]]s into a general probabilistic representation and inference mechanism for arbitrary nonlinear and non-norm ...
    8 KB (1,027 words) - 01:26, 8 March 2025
  • |thesis_title = The Design of Dynamic Data Structures |known_for = [[Probabilistic Roadmap Method]], [[GameMaker: Studio|GameMaker]] ...
    9 KB (1,136 words) - 15:56, 4 May 2025
  • ...set|countable]] [[discrete mathematics|discrete]] [[Mathematical structure|structures]]. * [[Probabilistic method|Probabilistic combinatorics]] ...
    9 KB (941 words) - 08:34, 14 July 2024
  • *[[Data-driven programming|Data-driven]] ***[[Probabilistic logic programming|Probabilistic logic]] ...
    15 KB (1,527 words) - 19:00, 2 June 2025
  • ...ual operations." |title=Lecture 18: Amortized Algorithms |work=CS312 -Data Structures and Functional Programming |date=2006 |publisher=Cornell University |url=ht ...ation of an algorithm, certain situations (e.g., input parametrizations or data structure contents) may imply a significant cost in resources, whereas othe ...
    10 KB (1,528 words) - 08:26, 15 March 2025
  • {{Short description|Probabilistic data structure}} {{Infobox data structure ...
    19 KB (2,862 words) - 09:09, 27 May 2025
  • ...ge case is the function which performs an average number of steps on input data of n elements.<ref>{{Cite web |title=Best, Worst, and Average Case Complexi ...accuracy of an overall worst-case analysis. [[Computer scientist]]s use [[probabilistic analysis]] techniques, especially [[expected value]], to determine expected ...
    13 KB (1,982 words) - 16:49, 23 October 2025
  • ...[[Inference network|Inference algorithms]] gather new developments in the data and calculate it based on the new information provided.<ref>{{Cite web|url= ...czysław A.|date=2018-06-06|title=Dempsterian-Shaferian Belief Network From Data|eprint=1806.02373|class=cs.AI}}</ref> [[Joint distributions]] are needed to ...
    10 KB (1,442 words) - 14:22, 25 October 2024
  • ...the same [[Protein folding|fold]] as proteins of known [[Protein structure|structures]], but do not have [[Homology (biology)#Homology of sequences in genetics|h ...ading works by using statistical knowledge of the relationship between the structures deposited in the PDB and the [[Primary structure|sequence]] of the protein ...
    15 KB (2,097 words) - 22:40, 5 September 2024
  • ...hen a collision occurs. Double hashing with open addressing is a classical data structure on a table <math>T</math>. ...[[linear probing]] and [[quadratic probing]], the interval depends on the data, so that values mapping to the same location have different bucket sequence ...
    9 KB (1,403 words) - 23:37, 31 January 2025
  • ...rt Sedgewick]</ref> His research expertise is in algorithm science, [[data structures]], and [[analytic combinatorics]]. He is also active in developing college ...sis of Heapsort. J. of Algorithms, 1993.</ref> and [[Batcher's sort]].<ref>Data Movement in Odd-Even Merging. SIAM Journal on Computing 7, 2, 1978.</ref> W ...
    17 KB (2,185 words) - 21:35, 7 January 2025
  • ...0 SP.svg|thumb|upright=1.2|Visual representation of a [[hash table]], a [[data structure]] that allows for fast retrieval of information]] ...Search algorithms work to retrieve information stored within particular [[data structure]], or calculated in the [[Feasible region|search space]] of a pro ...
    12 KB (1,627 words) - 11:51, 3 October 2025
  • He was editor-in-chief of the journal ''Random Structures and Algorithms'' from 2008 through 2023.<ref name=ae/> ...natorics]] and in [[theoretical computer science]], and one book, on the [[probabilistic method]]. He has also published under the pseudonym "A. Nilli", based on th ...
    16 KB (2,057 words) - 18:44, 16 June 2025
  • ===Induction of probabilistic grammars === ...s Dyer, and Alexander M. Rush. [https://arxiv.org/pdf/1906.10225 "Compound probabilistic context-free grammars for grammar induction."] arXiv preprint arXiv:1906.10 ...
    18 KB (2,433 words) - 08:39, 11 May 2025
  • ...ppe Flajolet and J.S. Vitter. Average-case analysis of algorithms and data structures. Technical report, Institut National de Recherche en Informatique et en Aut ...and which evolved into the [[AofA—International Meeting on Combinatorial, Probabilistic, and Asymptotic Methods in the Analysis of Algorithms]]. ...
    7 KB (867 words) - 20:37, 20 June 2025
  • ==Related structures== Polytrees have been used as a [[graphical model]] for [[probabilistic reasoning]].{{sfnp|Dasgupta|1999}} If a [[Bayesian network]] has the struct ...
    8 KB (999 words) - 06:20, 9 May 2025
  • ...s is thus a key part of the [[structural engineering|engineering design of structures]].<ref>[https://www.sciencedirect.com/topics/engineering/structural-analysi ==Structures and loads== ...
    19 KB (2,787 words) - 08:12, 10 November 2024
  • {{Short description|Array data structure that compactly stores bits}} ...that compactly stores [[bit]]s. It can be used to implement a simple [[set data structure]]. A bit array is effective at exploiting [[bit-level parallelism ...
    23 KB (3,695 words) - 21:58, 10 March 2025
  • ..., leading to their [[LZ77 and LZ78|LZ algorithm]] which "yields the best [[Data compression ratio|compression rate]] achievable by finite-state encoders" a |For "invention of the widely used [[Splay tree|splay-tree data structure]]".<ref name="ACM-PCKA-99" /> ...
    21 KB (2,662 words) - 12:26, 11 May 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)