Pages with the most 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)
- Trujillo and Olague 2008 (Corner Detection Feature Detection) (1 revision)
- Recursive Region Splitting ( Image Segmentation) (1 revision)
- Trino ( 4NF Decomposition) (1 revision)
- Reduction from $(\min, \leq)$ Product to Triangle in Unweighted Graph (1 revision)
- Reduction from 3-OV to Diameter 3 vs 7 (1 revision)
- Reduction from 3SUM' to 3SUM (1 revision)
- Reduction from 3SUM' to GeomBase (1 revision)
- Reduction from 3SUM' to Static Dihedral Rotation Queries (1 revision)
- Reduction from 3SUM to 3SUM' (1 revision)
- Renault’s Algorithm (SCCs Strongly Connected Components) (1 revision)
- SANDER P. V.; SNYDER J.; GORTER S. J.; HOPPE 2001 (Mesh Parameterization Mesh Parameterization) (1 revision)
- S. S. TSENG and R. C. T. LEE (Stable Marriage Problem Stable Matching Problem) (1 revision)
- Stable Marriage Problem/Stable Roommates Problem (1 revision)
- S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation) (1 revision)
- Statistics (1 revision)
- Steal/No-Force (1 revision)
- S-buffer/Scanline Rendering ( Shown Surface Determination) (1 revision)
- Steffensen's method (General Root Computation Root Computation) (1 revision)
- Räihä; Manilla (Multivalued Dependency Inference Problem Dependency Inference Problem) (1 revision)
- Stege, Fellows (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Stege, Fellows + Interleaving method (Niedermeier, Rossmanith) (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Stephen Alstrup, Cyril Gavoille, Haim Kaplan & Theis Rauhe (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Russell et. al. ( 4NF Decomposition) (1 revision)
- Ruchansky (Minimum Wiener Connector problem Wiener Index) (1 revision)
- Round-robin scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) (1 revision)
- Round-robin scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) (1 revision)
- Roth AlignACE (Motif Search Motif Search) (1 revision)
- Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- Root Computation with continuous first derivative (1 revision)
- Strassen's Algorithm (1 revision)
- Romani's algorithm (Matrix Multiplication Matrix Product) (1 revision)
- Rod-cutting problem (1 revision)
- String-Matching with Finite Automata (Single String Search String Search) (1 revision)
- Robson (3-Graph Coloring Graph Coloring) (1 revision)
- Robotics (1 revision)
- Rivin, Zabih (Counting Solutions n-Queens Problem) (1 revision)
- Risotto (Motif Search Motif Search) (1 revision)
- Rijndael / AES (Block Ciphers Block Ciphers) (1 revision)
- Ridder's method (General Root Computation Root Computation) (1 revision)
- String Graph with Ferragina–Manzini Index (Simpson, Durbin) (De Novo Genome Assembly De Novo Genome Assembly) (1 revision)
- Richardson and Domingos (Link Analysis Link Analysis) (1 revision)
- String Search (1 revision)
- Revuz's algorithm (Acyclic DFA Minimization DFA Minimization) (1 revision)
- Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance) (1 revision)
- Representative Algorithms (1 revision)
- Strong Exponential Time Hypothesis (SETH) (1 revision)
- Strong Triangle Conjecture (1 revision)
- Subgradient method (General, Constrained optimization Convex Optimization (Non-linear)) (1 revision)
- Support enumeration and search (n player games Nash Equilibria) (1 revision)
- Reduction from Triangles Cover Triangle to 3D Motion Planning (1 revision)