Pages with the most revisions
Jump to navigation
Jump to search
Showing below up to 50 results in range #651 to #700.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Chazelle & Edelsbrunner (Reporting all intersection points, line segments Line segment intersection) (2 revisions)
- Bellman–Ford algorithm (Ford 1956) (general weights Shortest Path (Directed Graphs)) (2 revisions)
- Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) (2 revisions)
- Chen's lambda-connected segmentation ( Image Segmentation) (2 revisions)
- Chen Ensembles of classifiers (Entity Resolution Entity Resolution) (2 revisions)
- Bellman dynamic programming algorithm (Subset Sum The Subset-Sum Problem) (2 revisions)
- Belloch (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (2 revisions)
- Bellare Active Learning (Entity Resolution Entity Resolution) (2 revisions)
- Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Vatti clipping algorithm (Polygon Clipping with Arbitrary Clipping Polygon Polygon Clipping) (2 revisions)
- Bayer, McCreight B-Tree ( Self-Balancing Trees Creation) (2 revisions)
- Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Barvinok (Geometric Maximum TSP The Traveling-Salesman Problem) (2 revisions)
- Cheriyan & Hagerup (st-Maximum Flow Maximum Flow) (2 revisions)
- Cheriyan et al. (st-Maximum Flow Maximum Flow) (2 revisions)
- Chiba and Nishizeki (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (2 revisions)
- Chin and Poon (LCS Longest Common Subsequence) (2 revisions)
- Barghout; Lauren Visual Taxometric approach ( Image Segmentation) (2 revisions)
- Chandran and Hochbaum (Bipartite Graph MCM Maximum Cardinality Matching) (2 revisions)
- Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) (2 revisions)
- Bareiss algorithm (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries) (2 revisions)
- Bentley (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (2 revisions)
- Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection) (2 revisions)
- The INDEGREE Algorithm (InDegree Analysis Link Analysis) (2 revisions)
- Balaban. (Reporting all intersection points, generalized segments Line segment intersection) (2 revisions)
- Bader & Cong Parallel Implementation (Undirected, General MST Minimum Spanning Tree (MST)) (2 revisions)
- Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP)) (2 revisions)
- Approximate MCSP (2 revisions)
- Wang Y-K; Fan K-C; Horng J-T ( Graph Edit Distance Computation) (2 revisions)
- Wang-Zhu-Cantor additive FFT (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Ausiello et al. (Maximum Cut, Approximate Maximum Cut) (2 revisions)
- Thorup's Sorting Algorithm (Comparison Sorting Sorting) (2 revisions)
- Chan's algorithm Parallel Implementation ( Variance Calculations) (2 revisions)
- Tarjan's DFS based algorithm (Topological Sorting Topological Sorting) (2 revisions)
- Chan-Singhal-Liu ( Mutual Exclusion) (2 revisions)
- Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) (2 revisions)
- Tarjan's off-line lowest common ancestors algorithm (Off-Line Lowest Common Ancestor Lowest Common Ancestor) (2 revisions)
- Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (2 revisions)
- Connected Subgraph (2 revisions)
- Wagner and Fischer (LCS Longest Common Subsequence) (2 revisions)
- Cohen–Sutherland (Rectangular Window Line Clipping) (2 revisions)
- Ciliberti; Mézard (Lossy Compression Data Compression) (2 revisions)
- Von zur Gathen-Gerhard additive FFT (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Bergland; Glenn radix-8 algorithm (Discrete Fourier Transform Discrete Fourier Transform) (2 revisions)
- Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem) (2 revisions)
- Terlaky's Criss-cross algorithm ( Linear Programming) (2 revisions)
- Cohen; Lee and Song ( Linear Programming) (2 revisions)
- Tarjan Splay Tree ( Self-Balancing Trees Creation) (2 revisions)
- Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers) (2 revisions)