Subcategories
All entries in Computer Science
An approximation algorithm efficiently finds feasible solutions to optimization problems with mathematically proven bounds on their distance from optimality.
approximation-algorithmArithmetic codingArithmetic coding is a lossless compression technique that represents a sequence of symbols through successive subdivisions of a probability interval.
arithmetic-codingArithmetic IntensityArithmetic intensity measures the arithmetic work performed per byte of data transferred across a specified memory boundary, helping identify compute and memory bottlenecks.
arithmetic-intensityARPANETARPANET was a pioneering packet-switched research network that began operating in 1969 and became a principal foundation of the Internet.
arpanetArray (Data Structure)An array is an indexed collection of elements, typically stored at regularly spaced memory locations for efficient direct access.
array-data-structureArthur SamuelArthur Samuel was an American computer scientist whose learning checkers programs helped establish machine learning as a field of research.
arthur-samuelArtificial General IntelligenceArtificial general intelligence is the proposed capability of an artificial system to learn, reason, and act effectively across a broad range of tasks and environments.
artificial-general-intelligenceArtificial IntelligenceArtificial intelligence is the field of computer science that builds systems able to do tasks linked to human intelligence, such as reasoning, learning, perception and language.
artificial-intelligenceArtificial Neural NetworkA computational model of interconnected units that learns patterns by adjusting numerical parameters, supporting prediction, representation learning, and data generation.
artificial-neural-networkarXivarXiv is a free, open-access online repository of scholarly preprints, founded in 1991, mainly for physics, mathematics and computer science.
arxivASCIIASCII is a seven-bit character-encoding standard whose assignments underpin modern text processing, programming languages, and Internet protocols.
asciiAssembly LanguageAssembly language represents machine instructions symbolically, giving programmers direct control over processor operations, registers, memory access, and hardware interfaces.
assembly-languageAssociation Rule LearningAssociation rule learning discovers interpretable co-occurrence relationships among items or attributes in large datasets.
association-rule-learningAsynchronous programmingAsynchronous programming organizes operations whose completion is handled separately from their initiation, enabling responsive applications and efficient coordination of waiting work.
asynchronous-programmingAtomic operationAn atomic operation is an indivisible action whose intermediate states cannot be observed by other participants within a specified concurrency model.
atomic-operationAttention mechanismAn attention mechanism dynamically weights input representations, enabling neural networks to select and combine information relevant to a particular computation.
attention-mechanismAttribute-Based Access ControlAttribute-based access control authorizes operations by evaluating policies against attributes of subjects, resources, actions, and their environment.
attribute-based-access-controlAuthenticationAuthentication establishes confidence in a claimed identity or the origin of data through credentials, protocols, and verification procedures.
authenticationAuthorizationAuthorization determines which actions a user, service, or other principal may perform on protected resources under a security policy.
authorizationAutoencoderAn autoencoder is a neural network that learns data representations by encoding inputs and reconstructing them under architectural or training constraints.
autoencoderAutomated PlanningAutomated planning is the computational construction of action strategies that achieve specified goals under models of how the world changes.
automated-planningAutomated Theorem ProvingAutomated theorem proving uses computational methods to establish logical consequences of formally stated axioms, supporting mathematics, verification, and machine reasoning.
automated-theorem-provingAutomatic Text SummarizationAutomatic text summarization produces shorter representations of documents while preserving information relevant to a particular purpose, audience, or query.
automatic-text-summarizationAverage PrecisionAverage precision evaluates ranked predictions by averaging precision over increases in recall, with conventions that vary across retrieval, classification, and object detection.
average-precisionB-treeA B-tree is a balanced multiway search tree that maintains sorted data and supports efficient searching, insertion, deletion, and external-memory access.
b-treeBackpropagationBackpropagation efficiently computes gradients through a computational graph, enabling the training of neural networks and other differentiable models.
backpropagationBackpropagation through timeBackpropagation through time computes gradients in recurrent models by unfolding their computations across time and propagating loss derivatives backward through the resulting graph.
backpropagation-through-timeBag-of-Words ModelA text representation that records word occurrences while disregarding their order, enabling numerical analysis, document retrieval, and machine learning.
bag-of-words-modelBashBash is a Unix command interpreter and scripting language that combines interactive command execution with facilities for automating processes, files, and system administration.
bashBatch normalizationBatch normalization standardizes neural-network activations using batch statistics and learned scale and shift parameters to support efficient training.
batch-normalizationBB84BB84 is a quantum key distribution protocol that uses four quantum states to establish shared secret keys and detect information leakage.
bb84Beam SearchBeam search is a heuristic search algorithm that retains a limited number of promising partial solutions at each step, trading search coverage for lower computational cost.
beam-searchBelief propagationBelief propagation computes marginal probabilities or optimal configurations in graphical models by exchanging local messages, exactly on trees and approximately on graphs with cycles.
belief-propagationBell LabsBell Labs is an industrial research organization established in 1925 whose discoveries helped shape modern telecommunications, electronics, and computing.
bell-labsBell–LaPadula ModelThe Bell–LaPadula model formalizes confidentiality in multilevel computer systems by restricting access and preventing information from flowing to lower security levels.
bell-lapadula-modelBellman–Ford AlgorithmThe Bellman–Ford algorithm computes single-source shortest paths in weighted graphs with negative edges and detects negative-weight cycles reachable from the source.
bellman-ford-algorithmBenchmark Data ContaminationBenchmark data contamination occurs when evaluation material enters model development or unauthorized evaluation inputs, compromising a benchmark’s ability to measure performance on unseen tasks.
benchmark-data-contaminationBERT (language model)BERT is a pretrained Transformer encoder that learns bidirectional text representations and can be adapted to many natural-language processing tasks.
bertBfloat16Bfloat16 is a 16-bit floating-point format that preserves the exponent range of binary32 while reducing precision, widely used in machine learning.
bfloat16Big dataBig data describes datasets whose scale, speed, or complexity requires scalable methods for storage, processing, and analysis.
big-dataBig-Omega NotationBig-Omega notation expresses an asymptotic lower bound on a function, commonly used to describe computational resource requirements as input size grows.
big-omega-notationBig-Theta NotationBig-Theta notation describes an asymptotically tight bound on a function’s growth, ignoring constant factors and behavior on sufficiently small inputs.
big-theta-notationBinary ClassificationBinary classification assigns an input to one of two mutually exclusive classes, often by comparing a learned score or probability with a decision threshold.
binary-classificationBinary HeapA binary heap is a complete binary tree with an ordering constraint that supports efficient access to and removal of the minimum or maximum element.
binary-heapBinary SearchBinary search locates a value or boundary in an ordered search space by repeatedly eliminating approximately half the remaining candidates.
binary-searchBinary Search TreeA binary search tree maintains keys in hierarchical order, supporting search, updates, and ordered queries with efficiency determined by its height.
binary-search-treeBinary treeA binary tree is a rooted data structure in which each node has at most two distinguished children, supporting searching, priority queues, expression processing, and hierarchical computation.
binary-treeBipolar Junction TransistorA bipolar junction transistor is a three-terminal semiconductor device that controls current through carrier injection across two interacting junctions.
bipolar-junction-transistorBitA bit is a binary digit and a unit of information, fundamental to digital computing, storage, and communication.
bitBlack-box TestingBlack-box testing evaluates a system’s externally observable behavior against specified expectations without deriving tests from its internal implementation.
black-box-testingBM25BM25 is a probabilistically motivated text-ranking model that combines term rarity, term-frequency saturation, and document-length normalization to estimate relevance to a query.
bm25Boolean Satisfiability ProblemThe Boolean satisfiability problem asks whether a Boolean formula has a truth assignment that makes it true, linking computational complexity with practical automated reasoning.
boolean-satisfiability-problemBoostingBoosting is an ensemble-learning approach that builds accurate predictive models by sequentially combining learners that address earlier errors.
boostingBootstrap AggregatingBootstrap aggregating, or bagging, combines models trained on resampled data to stabilize predictions and reduce variance.
baggingBreadth-First SearchBreadth-first search explores a graph in successive distance layers, finding shortest paths when every edge has equal cost.
breadth-first-searchBunBun is a JavaScript and TypeScript toolkit that combines a runtime, package manager, bundler, and test runner in a single executable.
bunBusiness email compromiseBusiness email compromise is targeted fraud that impersonates trusted business contacts to induce unauthorized payments, divert legitimate transactions, or obtain sensitive information.
business-email-compromiseByteA byte is a unit of digital information, conventionally consisting of eight bits, used to measure, store, address, and transmit computer data.
byteByte Order MarkA byte order mark is an initial Unicode signature that can identify a text encoding and, for UTF-16 and UTF-32, its byte order.
byte-order-markByte-pair encodingByte-pair encoding is a repeated pair-substitution algorithm used for lossless compression and, in adapted form, for learning subword vocabularies in language processing.
byte-pair-encoding