3,135 articles
Flink CDC
Flink CDC (Apache Flink CDC) is an open-source streaming data integration tool built on Apache Flink, defining ETL pipelines in YAML with connectors for MySQL, PostgreSQL, Oracle, and more. Donated to the ASF in 2024; latest release 3.7.0 (October 2026) adds AI model functions.
Flixster
Flixster was a social movie website founded in San Francisco in 2006 that let users rate and discover films with friends; Warner Bros. acquired it in 2011.
Floating-point arithmetic
Floating-point arithmetic is the method computers use to approximate real numbers as significand times base to an exponent, governed by the IEEE 754-2019 standard and subject to rounding error.
Floyd–Warshall algorithm
The Floyd–Warshall algorithm, also known as Warshall's algorithm, finds the shortest path between every pair of vertices in a weighted directed graph, handling negative edge weights and detecting negative cycles.
Fluentd
Fluentd: open-source data collector for a unified logging layer, created in 2011 by Sadayuki Furuhashi at Treasure Data, written in C and Ruby, a CNCF graduated project since April 2019.
FlyBase
FlyBase is a model organism database of genetic, molecular, and genomic data for the fruit fly Drosophila melanogaster, established in 1992 and serving as the primary online reference for Drosophila research.
Flyte
Flyte: open-source, Kubernetes-native workflow orchestration platform for ML and data pipelines, created at Lyft in 2016, open-sourced 2020, graduated LF AI & Data project; Flyte 2 is its pure-Python durable runtime.
FMA (music dataset)
FMA (Free Music Archive) is an open dataset for music information retrieval created by EPFL researchers and described at ISMIR 2017, with 106,574 mostly Creative Commons-licensed tracks by 16,341 artists and 161 genres.
FNAEG
FNAEG, the Fichier national automatisé des empreintes génétiques, is France's central forensic DNA database, created in 1998 to help solve crimes and identify the dead and missing.
Fokker–Planck model (machine learning)
A Fokker–Planck model in machine learning uses the Fokker–Planck equation to describe how a probability density evolves over time, underpinning generative modeling, sampling, and density estimation.
Fold (higher-order function)
Fold, also called reduce, is a higher-order function that combines the elements of a data structure into a single result, as in the left and right variants foldl and foldr.
Force-directed graph drawing
Force-directed graph drawing, also known as spring or force-based layout, positions graph vertices by treating edges as springs and letting the system settle into a low-energy state.
Foreign key
A foreign key, also known as a foreign key constraint, is a column or column group that must match a key in a referenced table, enforcing referential integrity.
Form I-140
Form I-140, Immigrant Petition for Alien Worker, is the petition filed with USCIS to classify a foreign worker for an employment-based immigrant visa, generally filed by the U.S. employer.
Form I-94
Form I-94 is the Arrival/Departure Record issued by U.S. Customs and Border Protection to foreign travelers admitted to the United States, recording their class of admission and authorized length of stay.
Formal concept analysis
Formal concept analysis is a mathematical method that derives a hierarchy of concepts, in the form of a lattice, from an object–attribute data table, used in data mining and ontology engineering.
Formal equivalence checking
Formal equivalence checking is a formal verification method that mathematically proves two circuit designs, such as golden RTL and a synthesized netlist, behave identically for all inputs.
Formal specification
A formal specification is a description of what a system should do, written in a language with mathematically defined syntax and semantics, so correctness can be checked by proof.
Forward algorithm
The forward algorithm is a dynamic programming algorithm that computes the likelihood of an observed sequence under a hidden Markov model, summing over all hidden state paths in O(N²T) time instead of exponentially.
Forward chaining
Forward chaining is a data-driven inference method that repeatedly applies a rule-based system's rules to known facts, deriving new facts until no rule applies or a target conclusion is reached.
Fountain code
A fountain code is a rateless erasure code that generates a limitless stream of encoded symbols, letting a receiver recover a message from any sufficiently large set received.
Fourier neural operator
The Fourier neural operator (FNO) is a neural network architecture, introduced by Zongyi Li and colleagues in 2020, that learns solutions to partial differential equations.
FP-Growth
FP-Growth is a data mining algorithm for frequent itemsets that compresses the database into an FP-tree and avoids candidate generation, proposed at SIGMOD in 2000.
FP-growth algorithm
FP-growth is a frequent itemset mining algorithm that compresses a transaction database into an FP-tree and finds all frequent itemsets without candidate generation, about ten times faster than Apriori.
FPRAS
An FPRAS (fully polynomial randomized approximation scheme) is a randomized algorithm that estimates counting problems within relative error ε with probability 1 − δ, in polynomial time.
FPT (complexity)
FPT, or fixed-parameter tractable, is the class of decision problems solvable in time f(k)·n^O(1), where k is a parameter, isolating exponential growth in k; it is the parameterized analog of P.
FPTAS
An FPTAS, or fully polynomial-time approximation scheme, is the strongest guarantee in the approximation hierarchy, combining arbitrarily good accuracy with running time polynomial in input size and 1/ε.
Fractional programming
Fractional programming is the branch of optimization that maximizes or minimizes ratios of functions, such as signal-to-noise ratio or energy efficiency, solved with Dinkelbach's transform and the quadratic transform.
Frame generation (graphics)
Frame generation is a real-time graphics technique that inserts AI-synthesized frames between rendered ones, introduced to PC gaming by NVIDIA's DLSS 3 in October 2022.
Frame problem
The frame problem is a problem in logic-based artificial intelligence: how a reasoning system that represents the world as facts can determine what an action leaves unchanged.