Pages with the fewest revisions
Jump to navigation
Jump to search
Showing below up to 50 results in range #251 to #300.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- 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, Proposition 3 ( Chromatic Polynomial) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( 5 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring) (1 revision)
- Bjorklund, Husfeldt, Theorem 1 ( Chromatic Number) (1 revision)
- Blakley's scheme ( Secret Sharing) (1 revision)
- Compression/Clustering (Vector Quantization) (k-ANNS Nearest Neighbor Search) (1 revision)
- Blinn and Newell (Environment Mapping Texture Mapping) (1 revision)
- Blinn–Phong (Specular Reflection Texture Mapping) (1 revision)
- Cocke–Younger–Kasami algorithm (CFG Recognition CFG Problems) (1 revision)
- Block A* (Informed Search Informed Search) (1 revision)
- Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem) (1 revision)
- Blossom Algorithm (general graph Maximum cardinality matching) (1 revision)
- Blowfish (Block Ciphers Block Ciphers) (1 revision)
- Blum, Shelton, Koller (Graphical games, Multi-agent influence diagrams Nash Equilibria) (1 revision)
- Conjugate Gradient (Approximation? with positive definite matrix Linear System) (1 revision)
- Bodlaender (Partial k-trees Graph Isomorphism Problem) (1 revision)
- Conjugate Gradient (Positive Definite Matrix Linear System) (1 revision)
- Constructing suffix trees (1 revision)
- Boman; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (1 revision)
- CHAZELLE 1986 (Counting number of intersection points / line segments Line segment intersection) (1 revision)
- Chaitin's Algorithm (Global Register Allocation Register Allocation) (1 revision)
- Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) (1 revision)
- Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring) (1 revision)
- Bottom-m sketches streaming algorithm (streaming Cardinality Estimation) (1 revision)
- Bowyer–Watson Algorithm (1 revision)
- Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Boyer-Moore-Horspool (BMH) (Single String Search String Search) (1 revision)
- Boyer-Moore (BM) algorithm (Single String Search String Search) (1 revision)
- Convex Hull (1 revision)
- Brand et al ( Maximum Flow) (1 revision)
- Brandes (Unweighted Betweenness Centrality (BC)) (1 revision)
- Brandes (Weighted Betweenness Centrality (BC)) (1 revision)
- Braziunas & Boutilier; 2004; (POMDPs POMDPs) (1 revision)
- Brent's algorithm ( Cycle Detection) (1 revision)
- Brent-Dekker Method (General Root Computation Root Computation) (1 revision)
- Bresenham's Line Algorithm (1 revision)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) (1 revision)
- Bresenham Algorithm (Rasterization Rasterization) (1 revision)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) (1 revision)
- Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter) (1 revision)
- Bron–Kerbosch Algorithm (1 revision)
- Cyclopeptide sequencing (1 revision)
- Cube Sort Parallel Implementation (Comparison Sorting Sorting) (1 revision)
- Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication) (1 revision)