Pages with the fewest revisions
Jump to navigation
Jump to search
Showing below up to 50 results in range #1,001 to #1,050.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) (1 revision)
- Closed formula ( LU Decomposition) (1 revision)
- Closed formula (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Clock (Online Page Replacements) (1 revision)
- Cooper and Dasgupta algorithm ( Register Allocation) (1 revision)
- Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (1 revision)
- Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) (1 revision)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) (1 revision)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) (1 revision)
- Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem) (1 revision)
- Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms) (1 revision)
- Chu-Liu-Edmonds Algorithm (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (1 revision)
- Chromatic Polynomial (1 revision)
- Christofides algorithm (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- Christofides ( Chromatic Number) (1 revision)
- Chow's Algorithm (Global Register Allocation Register Allocation) (1 revision)
- Cholesky Decomposition (Matrix Factorization Collaborative Filtering) (1 revision)
- Counting Sort (Non-Comparison Sorting Sorting) (1 revision)
- Cholesky (Positive Definite, Hermitian Matrix Linear System) (1 revision)
- Couvreur (SCCs Strongly Connected Components) (1 revision)
- Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Chin (Approximate MCOP Matrix Chain Multiplication) (1 revision)
- Cryptography (1 revision)
- Cube Sort Parallel Implementation (Comparison Sorting Sorting) (1 revision)
- Cherkassky ( Maximum Flow) (1 revision)
- Culling (1 revision)
- Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST)) (1 revision)
- Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST)) (1 revision)
- Chen et al ( Maximum Flow) (1 revision)
- Cyclopeptide sequencing (1 revision)
- Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter) (1 revision)
- Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication) (1 revision)
- D* (Informed Search Informed Search) (1 revision)
- Chatlin's Algorithm (1 revision)
- D* Lite ( Informed Search) (1 revision)
- Chandran and F. Grandoni (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Chandra (Approximate MCOP Matrix Chain Multiplication) (1 revision)
- Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull) (1 revision)
- Chan (Real 3SUM 3SUM) (1 revision)
- Chan, Williams (OV Orthogonal Vectors) (1 revision)
- DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization) (1 revision)
- Chan's algorithm (2-dimensional; 3-dimensional Convex Hull) (1 revision)
- Chaitin's Algorithm (Global Register Allocation Register Allocation) (1 revision)
- DE NOVO GENOME ASSEMBLY (1 revision)
- Census (Motif Search Motif Search) (1 revision)
- Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem) (1 revision)
- Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem) (1 revision)
- Calvetti, Reichel (2-D Polynomial Interpolation Polynomial Interpolation) (1 revision)
- Digraph realization problem (1 revision)