Most linked-to pages
Jump to navigation
Jump to search
Showing below up to 50 results in range #801 to #850.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) (2 links)
- Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) (2 links)
- Convex Hull (2 links)
- Convex Optimization (Non-linear) (2 links)
- Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) (2 links)
- Cooley–Tukey algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 links)
- Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) (2 links)
- Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) (2 links)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) (2 links)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) (2 links)
- Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product) (2 links)
- Covanov and Thomé ( Multiplication) (2 links)
- Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition) (2 links)
- Cyrus–Beck (Convex Polygonal Window; Convex Polyhedral window Line Clipping) (2 links)
- Czumaj (Approximate MCOP Matrix Chain Multiplication) (2 links)
- Czumaj (Matrix Chain Scheduling Problem Matrix Chain Multiplication) (2 links)
- D* (Informed Search Informed Search) (2 links)
- D* Lite ( Informed Search) (2 links)
- DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization) (2 links)
- Daitch; Spielman (Inexact Laplacian Solver SDD Systems Solvers) (2 links)
- Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (2 links)
- Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem) (2 links)
- David (Square Matrix LU Decomposition LU Decomposition) (2 links)
- David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 links)
- David Mumford and Jayant Shah (1989) ( Image Segmentation) (2 links)
- Davis-Putnam-Logemann-Loveland Algorithm (DPLL) (CNF-SAT Boolean Satisfiability) (2 links)
- De ( Multiplication) (2 links)
- De Berg; Cheong (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly) (2 links)
- De Prisco (Approximate OBST Optimal Binary Search Trees) (2 links)
- Dekel; Nassimi & Sahni Parallel Implementation (Topological Sorting Topological Sorting) (2 links)
- Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion) (2 links)
- Del Moral; Pierre (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (2 links)
- Demand-Driven Register Allocation (Global Register Allocation Register Allocation) (2 links)
- Diffie–Hellman key exchange (Key Exchange Key Exchange) (2 links)
- Digital Differential Analyzer (DDA) (Rasterization Rasterization) (2 links)
- Digital Differential Analyzer (Line Drawing Line Drawing) (2 links)
- Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 links)
- Dijkstra's algorithm with Fibonacci heap (Johnson 1981; Karlsson & Poblete 1983) (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (2 links)
- Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 links)
- Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 links)
- Dijkstra (Counting Solutions; Constructing solutions n-Queens Problem) (2 links)
- Discrete Cosine Transform (Lossy Compression Data Compression) (2 links)
- Divide and Conquer ( Minimum value in each row of an implicitly-defined totally monotone matrix) (2 links)
- Dixon's algorithm (Second Category Integer Factoring Integer Factoring) (2 links)
- Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition) (2 links)
- Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Downey (The Vertex Cover Problem The Vertex Cover Problem) (2 links)
- Drysdale; Su (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 links)
- Dual clustering - Guberman ( Image Segmentation) (2 links)