Pages with the fewest revisions
Jump to navigation
Jump to search
Showing below up to 50 results in range #851 to #900.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Bentley (2-dimensional Maximum subarray problem) (1 revision)
- Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) (1 revision)
- Berkman; Vishkin (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Earley parser (CFG Parsing CFG Problems) (1 revision)
- EM Based Winkler (Entity Resolution Entity Resolution) (1 revision)
- Bertsekas & Castanon; 1999; (POMDPs POMDPs) (1 revision)
- ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization) (1 revision)
- Dürer rendering algorithm ( Ray Tracing) (1 revision)
- Bidirectional A* Algorithm (Informed Search Informed Search) (1 revision)
- Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem) (1 revision)
- Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring) (1 revision)
- Dynamic Programming (Change-Making Problem Change-Making Problem) (1 revision)
- Bijaoui and Rué ( Image Segmentation) (1 revision)
- Dynamic 2-d Convex Hull, Overmars and van Leeuwen (2-dimensional Convex Hull, Dynamic Convex Hull) (1 revision)
- Dyer (2-dimensional array representation Closest Pair Problem) (1 revision)
- Binary GCD algorithm (Greatest Common Divisor Greatest Common Divisor) (1 revision)
- Binary representation search with matrix multiplication (Unweighted Graph Diameter) (1 revision)
- Binary space partitioning (BSP) ( Shown Surface Determination) (1 revision)
- Bini's algorithm (Matrix Multiplication Matrix Product) (1 revision)
- BioInformatics (1 revision)
- Bird (1D Maximum Subarray Maximum Subarray Problem) (1 revision)
- Bisection method (Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Doolittle Algorithm (1 revision)
- Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (1 revision)
- Bodlaender (Partial k-trees Graph Isomorphism Problem) (1 revision)
- Blum, Shelton, Koller (Graphical games, Multi-agent influence diagrams Nash Equilibria) (1 revision)
- Divide and Conquer ( Minimum value in each row of an implicitly-defined totally monotone matrix) (1 revision)
- Blowfish (Block Ciphers Block Ciphers) (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)
- Blossom Algorithm (general graph Maximum cardinality matching) (1 revision)
- Domain:Image Processing (1 revision)
- Block A* (Informed Search Informed Search) (1 revision)
- Blinn–Phong (Specular Reflection Texture Mapping) (1 revision)
- Blinn and Newell (Environment Mapping Texture Mapping) (1 revision)
- Domain:Robotics (1 revision)
- Blakley's scheme ( Secret Sharing) (1 revision)
- Domain:Statistics (1 revision)
- Bjorklund, Husfeldt, Proposition 3 ( Chromatic Polynomial) (1 revision)
- Bisection method (General Root Computation Root Computation) (1 revision)
- Bitap algorithm (Single String Search String Search) (1 revision)
- Dual subgradients and the drift-plus-penalty method (Stochastic optimization Convex Optimization (Non-linear)) (1 revision)
- Bjorck-Pereyra (Vandermonde Matrix Linear System) (1 revision)
- Bjorck (2-D Polynomial Interpolation Polynomial Interpolation) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( 6 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Proposition 2 ( Chromatic Number) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring) (1 revision)