Search results
Jump to navigation
Jump to search
- ...t=Thielecke|first=Hayo|date=December 9, 2015|title=Implementing functional languages with abstract machines|url=https://www.cs.bham.ac.uk/~hxt/2015/compilers/co ...niel P.|date=October 1986|title=A Calculus for Assignments in Higher-Order Languages|url=https://legacy.cs.indiana.edu/ftp/techreports/TR202.pdf|archive-url=|ar ...16 KB (2,329 words) - 12:56, 9 July 2024
- {{short description|Concept in type theory}} ...his value can be given the intersection type <math>\sigma \cap \tau</math> in an [[intersection type system]].<ref name=BCD83>{{cite journal |doi=10.2307 ...25 KB (3,306 words) - 11:24, 23 November 2024
- {{Short description|Programming language}} ...pages 169-206. Springer, 2011.</ref> is a [[domain-specific language]] for programming and analyzing coordination protocols that compose individual ''processes'' ...12 KB (1,753 words) - 02:21, 27 November 2024
- In [[data structure]]s, the range mode query problem asks to build a data stru ...> because it occurs three times, while all other values occur fewer times. In this problem, the queries ask for the mode of subarrays of the form <math>A ...14 KB (2,690 words) - 03:15, 3 June 2021
- ...portant applications in finding the [[Critical path method|critical path]] in scheduling problems. ...nder|last=Schrijver|authorlink=Alexander Schrijver|publisher=Springer|year=2003|isbn=9783540443896|page=114|url=https://books.google.com/books?id=mqGeSQ6dJ ...22 KB (3,035 words) - 20:57, 12 October 2024
- ...l which parse is intended. Syntactic parsing is one of the important tasks in [[computational linguistics]] and [[natural language processing]], and has '''Constituency parsing''' involves parsing in accordance with constituency grammar formalisms, such as [[Minimalism (ling ...23 KB (3,324 words) - 03:01, 8 January 2024
- {{expert needed|mathematics|ex2=computer science|reason=missing key results in free monoids, such as Levi's lemma, Fine and Wilf's theorem, Makanin's algo ...[algorithm]]s and [[Computer programming|coding]]. It led to developments in [[abstract algebra]] and answering open questions. ...20 KB (2,945 words) - 13:32, 13 February 2025
- ...direct|National identity cards in China|other uses|National identity cards in China (disambiguation)}} ...nzhèng}}) is an official [[identity document]] for personal identification in the [[People's Republic of China]]. According to the second chapter, tenth ...29 KB (3,655 words) - 15:31, 18 February 2025
- | header3 = [[Time complexity]] and {{nowrap|[[space complexity]]}} {{nowrap|in [[big O notation]]}} ...e longest common prefixes (LCPs) between all pairs of consecutive suffixes in a sorted suffix array. ...28 KB (4,576 words) - 13:32, 13 June 2024
- In [[computer science]], a '''suffix automaton''' is an efficient [[data struc In terms of [[automata theory]], a suffix automaton is the [[Minimal automaton ...55 KB (8,483 words) - 20:57, 12 December 2024
- ...reserved while provably limiting what can be inferred about any individual in the dataset. ...cal database which limits the disclosure of private information of records in the database. For example, differentially private algorithms are used by so ...40 KB (5,735 words) - 18:35, 7 February 2025
- {{Women in society sidebar|science}} This page aims to list inventions and discoveries in which women played a major role. ...65 KB (8,935 words) - 15:53, 8 February 2025
- This problem arises in the area of scheduling, where it models jobs that require a contiguous port ...irst2=Edward G. |last3=Rivest |first3=Ronald L. |title=Orthogonal Packings in Two Dimensions |journal=SIAM J. Comput. |date=1980 |volume=9 |issue=4 |page ...48 KB (7,617 words) - 01:28, 17 December 2024
- ...ean algebra is therefore a formal way of describing [[logical operation]]s in the same way that elementary algebra describes numerical operations. ...d is provided for in all modern [[programming language]]s. It is also used in [[set theory]] and [[statistics]].<ref name="Givant-Halmos_2009"/> ...74 KB (11,051 words) - 05:32, 16 January 2025
- ...omon |first3=Richard |date=2003-09-18 |title=Proposal to Encode Kharoṣ ṭhī in Plane 1 of ISO/IEC 10646 |url=https://www.unicode.org/L2/L2003/03314-kharos ...|last1=Everson|first1=Michael|title=Proposal for encoding the Mende script in the SMP of the UCS|url=https://www.unicode.org/L2/L2011/11301r-n4133-mende. ...51 KB (6,412 words) - 21:53, 16 February 2025
- | caption = Solem in September 2014 ...Laboratory]]. Solem has authored or co-authored over 185 technical papers in many different scientific fields.<ref>{{cite web |title= Google Scholar - J ...31 KB (4,025 words) - 18:22, 15 January 2025
- ...into its life cycle. This process simplifies the identification of errors in [[Analytics|data analytics]] workflows, by enabling users to trace issues b .... This can be used in [[Debugger|debugging]] or regenerating lost outputs. In [[database system]]s, this concept is closely related to [[Provenance#Data ...42 KB (6,407 words) - 21:32, 18 January 2025
- ...uding terms relevant to [[software]], [[data science]], and {{gli|computer programming}}. ...tics}}) from the point of view of a {{gli|user}} of the data, specifically in terms of possible values, possible operations on data of this type, and the ...214 KB (29,880 words) - 09:50, 28 January 2025
- ...y's table of chords|calculation of chords]], while mathematicians in India created the earliest-known tables of values for trigonometric ratios (also called [ Throughout history, trigonometry has been applied in areas such as [[geodesy]], [[surveying]], [[celestial mechanics]], and [[na ...50 KB (7,134 words) - 04:00, 2 February 2025
- ...f quantum computing''' is a list of definitions of terms and concepts used in [[quantum computing]], its sub-disciplines, and related fields. ...mplified error correcting procedures unlike codes which encode information in the [[Space (mathematics)|subspace]] of a Hilbert space.<ref> ...47 KB (6,357 words) - 13:44, 8 January 2025