Pages with the most revisions
Jump to navigation
Jump to search
Showing below up to 50 results in range #1,051 to #1,100.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Derek's Algorithm ( 4NF Decomposition) (1 revision)
- Dial's Algorithm (nonnegative integer weights Shortest Path (Directed graphs)) (1 revision)
- Diffie–Hellman key exchange (Key Exchange Key Exchange) (1 revision)
- Diffuse Reflection (1 revision)
- Digital Differential Analyzer (DDA) (Rasterization Rasterization) (1 revision)
- Digraph realization problem (1 revision)
- Dijkstra's Algorithm (1 revision)
- Dijkstra (Counting Solutions; Constructing solutions n-Queens Problem) (1 revision)
- Dinitz ( Maximum Flow) (1 revision)
- Discovering multivalued dependencies (1 revision)
- Discrete Cosine Transform (Lossy Compression Data Compression) (1 revision)
- Divide and Conquer ( Minimum value in each row of an implicitly-defined totally monotone matrix) (1 revision)
- Dixon's algorithm (Second Category Integer Factoring Integer Factoring) (1 revision)
- Domain:Bioinformatics (1 revision)
- Domain:Cryptography (1 revision)
- Domain:Databases (1 revision)
- Domain:Image Processing (1 revision)
- Domain:Robotics (1 revision)
- Domain:Statistics (1 revision)
- Doolittle Algorithm (1 revision)
- Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Downey (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (1 revision)
- Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear)) (1 revision)
- Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations) (1 revision)
- Dyer (2-dimensional array representation Closest Pair Problem) (1 revision)
- Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull) (1 revision)
- Dynamic Programming (Change-Making Problem Change-Making Problem) (1 revision)
- Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring) (1 revision)
- Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem) (1 revision)
- Dürer rendering algorithm ( Ray Tracing) (1 revision)
- ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization) (1 revision)
- EM Based Winkler (Entity Resolution Entity Resolution) (1 revision)
- Earley parser (CFG Parsing CFG Problems) (1 revision)
- Edmonds-Karp (bipartite (i.e. assignment), general Maximum-weight matching) (1 revision)
- Edmonds-Karp Algorithm (1 revision)
- Edmonds (Maximum-Weight Matching Maximum-Weight Matching) (1 revision)
- Elliptic-curve Diffie-Hellman (ECDH) (1 revision)
- Elliptic-curve Diffie-Hellman (ECDH) (Key Exchange Key Exchange) (1 revision)
- Emil Praun (Environment Mapping Texture Mapping) (1 revision)
- Entity resolution (1 revision)
- Enumerating Maximal Cliques (1 revision)
- Environment Mapping (1 revision)
- Eppstein (Subset Sum The Subset-Sum Problem) (1 revision)
- Eppstein ( Chromatic Number) (1 revision)
- Epstein (Subset Sum The Subset-Sum Problem) (1 revision)
- Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor) (1 revision)
- Exact k-Clique Hypothesis (1 revision)
- Exhaustive search (Minimum Wiener Connector problem Wiener Index) (1 revision)