3,135 articles
Boltzmann generator
A Boltzmann generator is a machine learning method introduced by Frank Noé and colleagues in 2019 that samples equilibrium states of many-body systems with deep learning.
Boltzmann machine
The Boltzmann machine is a stochastic generative neural network of binary units, introduced by Ackley, Hinton, and Sejnowski in 1985 and named after Ludwig Boltzmann, whose distribution governs its states.
Boolean network
A Boolean network is a discrete dynamical model in which each component carries a binary on/off state, and logical rules determine how those states change over time.
Boomi
Boomi is a Conshohocken, Pennsylvania integration platform as a service (iPaaS) company founded by Rick Nucci in 2000, owned by Francisco Partners and TPG since a 2021 $4 billion carve-out from Dell, with over 30,000 customers and an AI agent platform.
Boosting (machine learning)
Boosting is a machine learning ensemble method that combines weak learners sequentially, each focusing on hard examples; AdaBoost, gradient boosting, and XGBoost made it dominant for tabular data.
Bootstrap aggregating
Bootstrap aggregating, usually shortened to bagging, is a machine learning ensemble method introduced by Leo Breiman in 1996 that combines predictors trained on bootstrap samples and underlies random forests.
Boson sampling
Boson sampling is a quantum sampling task in which identical photons pass through a linear optical network, proposed by Aaronson and Arkhipov in 2010 to demonstrate quantum advantage.
BoTorch
BoTorch is an open-source Python library for Bayesian Optimization research, built on PyTorch and used for hyperparameter optimization, A/B testing, and scientific design; Ax uses it as its optimization backend.
Boundary representation
Boundary representation, or B-rep, is a solid modeling method used in computer-aided design that stores a shape's enclosing faces, edges, and vertices rather than its volume.
Bounded model checking
Bounded model checking is a formal verification method introduced in 1999 that uses a SAT solver to find counterexamples to a temporal logic specification within a fixed step bound.
Boyce–Codd normal form
Boyce–Codd normal form (BCNF, also called 3.5NF) is a normal form in relational database design, a stricter version of third normal form developed by Boyce and Codd in 1974.
Boyer–Moore string-search algorithm
The Boyer–Moore string-search algorithm, invented by Robert S. Boyer and J Strother Moore around 1975, finds a pattern in a text by comparing characters right to left and skipping ahead using precomputed shift tables.
Bracketing F1 score
Bracketing F1 score, also called labeled F1 or LF1, is the standard accuracy measure for constituency parsing, first proposed in the 1991 PARSEVAL evaluation scheme.
Brain age estimation
Brain age estimation is a machine learning method that predicts a person's age from brain MRI features, with the gap serving as a biomarker of brain health.
Brain extraction
Brain extraction, also called skull stripping, is an image-analysis step that removes nonbrain tissue such as skull, scalp, and eyes from MRI scans; tools include BET, SynthStrip, and HD-BET.
Branch and bound
Branch and bound is an algorithmic method for solving discrete and combinatorial optimization problems exactly, proposed by A. H. Land and A. G. Doig in 1960.
Branch and price
Branch and price is an exact optimization algorithm combining branch-and-bound search with column generation, used for problems with exponentially many variables such as crew scheduling and vehicle routing.
Breadth-first search
Breadth-first search, also called BFS, is a graph traversal algorithm that explores a graph level by level from a source, computing shortest paths in linear time O(|V| + |E|).
Bresenham's line algorithm
Bresenham's line algorithm, also called Bresenham's line drawing algorithm, is a method for drawing lines on pixel grids using only integer arithmetic, published by Jack Bresenham at IBM in 1965.
BRIEF (computer vision)
BRIEF (Binary Robust Independent Elementary Features) is a computer vision feature descriptor representing an image patch as a short binary string, proposed at EPFL in 2010.
British National Corpus
The British National Corpus (BNC) is a 100-million-word computer-readable collection of written and spoken British English from the early 1990s, compiled between 1991 and 1994 by a consortium led by Oxford University Press.
Broad learning system
The broad learning system (BLS) is a flat neural network introduced by C. L. Philip Chen and Zhulin Liu in 2017, trained far faster than deep learning.
Brotli
Brotli is a lossless data compression algorithm developed at Google, combining LZ77 and Huffman coding and designed to replace gzip for web content such as HTML and fonts.
Broyden–Fletcher–Goldfarb–Shanno algorithm
The Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm, or BFGS method, is a quasi-Newton optimization method that approximates the Hessian from gradients. It was derived independently by four researchers in 1970.
Brute-force search
Brute-force search, also called exhaustive search, is an algorithmic strategy that checks every possible solution to a problem, always finding the correct answer but expected to be slow.
BTDigg
BTDigg, also known as Btdig, is a BitTorrent DHT search engine launched in 2011 that indexes magnet links by crawling the distributed hash table rather than collecting torrent files.
Bubble sort
Bubble sort, also known as sinking sort, is a simple sorting algorithm that repeatedly compares adjacent elements and swaps them when they are out of order.
Bucket sort
Bucket sort, or bin sort, is a sorting algorithm that distributes elements into buckets covering subranges of the key space, sorts each bucket, and concatenates them in order.
Building a Scalable Data Warehouse with Data Vault 2.0
Building a Scalable Data Warehouse with Data Vault 2.0, by Dan Linstedt and Michael Olschimke (Morgan Kaufmann, 2015), teaches hub-link-satellite modeling, agile Data Vault 2.0 methodology, hash keys, and layered warehouse architecture.
Building change detection
Building change detection is a remote sensing method that compares satellite or aerial images taken at different dates to find constructed, demolished, or altered buildings.