Search results
Jump to navigation
Jump to search
Page title matches
- {{Short description|Electromechanical analog computer}} ...vy Mk III Torpedo Data Computer, the standard US Navy torpedo fire control computer during World War II. Later in World War II (1943), it was replaced by the T ...30 KB (4,470 words) - 23:36, 6 February 2025
Page text matches
- ...}}</ref> Tensor glyphs are a particular case of multivariate data [[Glyph (data visualization)|glyphs]]. ...s and Gordon L. Kindlmann | journal=IEEE Transactions on Visualization and Computer Graphics |date=November–December 2010 | volume= 16 | issue= 6 | pages=1595– ...2 KB (276 words) - 08:26, 26 October 2022
- ...tree accumulation''' is the process of accumulating data placed in [[Tree (data structure)|tree]] nodes according to their [[Tree (data structure)|tree]] structure.<ref>{{cite thesis |type=Ph.D. |first=Jeremy |l ...2 KB (220 words) - 02:35, 16 July 2018
- {{Short description|Concept in computer science}} In [[computer science]], a '''doubly logarithmic tree''' is a [[Tree (data structure)|tree]] where each internal node of height 1, the tree layer abov ...2 KB (267 words) - 04:28, 31 July 2024
- ...Average Memory Access Time''' ('''AMAT''') is a common metric to analyze [[computer memory]] system performance. ...ing simultaneously. Recently AMAT has been extended to consider concurrent data access. A model, called Concurrent-AMAT (C-AMAT), is introduced for more ac ...2 KB (321 words) - 09:40, 23 May 2022
- ...ary digits, called [[bit]]s, necessary to represent an unsigned [[integer (computer science)|integer]]<ref>{{cite web |url=http://reference.wolfram.com/mathema ...t is encoded in [[binary code|binary]] format. The binary format expresses data as an arbitrary length series of values with one of two choices: Yes/No, 1/ ...2 KB (306 words) - 12:56, 29 June 2024
- ...erms built with unary symbols and constants can be considered as [[string (computer science)|strings]]. Higher arities lead to proper [[Tree (automata theory)| [[Category:Trees (data structures)]] ...1 KB (220 words) - 20:16, 6 April 2023
- ...ency]] exceeds a user-given threshold. The algorithm works by dividing the data stream into buckets for frequent items, but fill as many buckets as possibl ...here data takes the form of a continuous data stream instead of a finite [[data set]], such as [[network traffic measurement]]s, [[web server]] logs, and [ ...2 KB (299 words) - 04:52, 3 March 2023
- {{Infobox data structure | type = [[Heap (data structure)|Heap]]/[[priority queue]] ...2 KB (317 words) - 18:49, 7 November 2024
- ...eory. 2018.</ref> when studying [[Upper and lower bounds|lower bounds]] in computer science named after [[Rasmus Pagh]]. [[Mihai Pătrașcu (computer scientist)|Mihai Pătrașcu]] was the first to give lower bounds for the prob ...2 KB (247 words) - 22:48, 6 August 2021
- ...imality is a property of some [[binary search tree ]] data structures in [[computer science]] Suppose that [[Attribute–value pair|key-value pairs]] are stored in a data ...2 KB (329 words) - 13:53, 30 September 2019
- ...SE) and other [[algorithm]]s that can be efficiently executed on encrypted data. ...information about the data or queries can be recovered from the encrypted data structure and tokens beyond a well-specified and "reasonable" leakage profi ...4 KB (515 words) - 04:03, 22 March 2024
- ...[[batch processing|batch]] mode for [[Import and export of data|exporting data]] from an institution. ...er databases or by looking at unique characteristics found in the [[field (computer science)|field]]s and [[row (database)|records]] of the [[database]] itself ...5 KB (710 words) - 23:35, 9 December 2023
- ...It is a generalization of the [[Heap (data structure)|Heap]].<ref>Advanced Data Structures, Peter Brass, {{ISBN|978-0-521-88037-4}}, page 270</ref> It allo [[Category:Heaps (data structures)]] ...3 KB (428 words) - 11:12, 11 March 2022
- A '''kinetic Euclidean minimum spanning tree''' is a [[kinetic data structure]] that maintains the [[Euclidean minimum spanning tree]] (EMST) o ...the EMST in [[Polylogarithmic time|polylog time]] per event. Their kinetic data structure handles <math>O(n*m)</math> events, where m is the number of all ...2 KB (260 words) - 01:37, 23 July 2023
- {{short description|Method of analyzing large data sets}} ...'-way array, and analysis techniques can reveal patterns in the underlying data undetected by other methods.<ref name=Coppi1989> ...7 KB (963 words) - 11:23, 26 October 2023
- '''Storage efficiency''' is the ability to store and manage data that consumes the least amount of space with little to no impact on perform ..., often to over 100% for primary data, and thousands of percent for backup data. ...5 KB (671 words) - 21:11, 14 April 2022
- {{short description|American computer scientist}} | field = [[Computer science]], [[information visualization]] ...6 KB (789 words) - 21:36, 21 January 2025
- {{Short description|Compressed data structure for pattern matching}} ...00"/> These data structures enable quick search for an arbitrary [[String (computer science)|string]] with a comparatively small index. ...6 KB (859 words) - 00:53, 6 December 2024
- {{Short description|Data structure}} ...ete'' and ''find-max''. They are often used as components of other kinetic data structures, such as [[kinetic closest pair]]. ...4 KB (616 words) - 19:00, 3 January 2023
- ...Its chief application is the investigation of [[Insider threat|insider]] [[data theft]].<ref name="J_Digital_Investigation"/><ref name="Information_Week"/> ...er threat|insider]] [[data theft]].<ref name="Information_Week"/> Insider data theft has been notoriously difficult to investigate using traditional metho ...8 KB (1,082 words) - 16:57, 26 January 2023