Uncategorized pages
Jump to navigation
Jump to search
Showing below up to 50 results in range #1,501 to #1,550.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Ray tracing ( Shown Surface Determination)
- Rayleigh quotient iteration (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))
- Raymond's algorithm ( Mutual Exclusion)
- Raz & Safra ( The Set-Covering Problem)
- Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification)
- Reach Centrality
- Reachability in MDPs
- Real 3SUM
- Record linking (Entity Resolution Entity Resolution)
- Recovery
- Rectangular Matrix LU Decomposition
- Rectangular Window
- Recursion based (Tower of Hanoi Tower of Hanoi)
- Recursive Region Splitting ( Image Segmentation)
- Reduction from $(\min, \leq)$ Product to Triangle in Unweighted Graph
- Reduction from 3-OV to Diameter 3 vs 7
- Reduction from 3-OV to k-OV
- Reduction from 3SUM' to 3SUM
- Reduction from 3SUM' to GeomBase
- Reduction from 3SUM' to Static Dihedral Rotation Queries
- Reduction from 3SUM to 3SUM'
- Reduction from 3SUM to 3 Points on Line
- Reduction from 3SUM to All-Integers 3SUM
- Reduction from 3SUM to Local Alignment
- Reduction from 3 Points on Line to Point on 3 Lines
- Reduction from All-Integers 3SUM to 3SUM
- Reduction from All Pairs Minimum Witness (APMW) to Negative Triangle Detection
- Reduction from Approximate Betweenness Centrality to Diameter
- Reduction from BMM to (5/3)-approximate ap-shortest paths
- Reduction from BMM to 1-sensitive (3/2)-approximate ss-shortest paths
- Reduction from BMM to 1-sensitive (4/3)-approximate decremental diameter
- Reduction from BMM to 1-sensitive (4/3)-approximate decremental eccentricity
- Reduction from BMM to 1-sensitive decremental st-shortest paths
- Reduction from BMM to 1-sensitive incremental ss-reach
- Reduction from BMM to 2-sensitive (7/5)-approximate st-shortest paths
- Reduction from BMM to 2-sensitive incremental st-reach
- Reduction from BMM to CFG Parsing
- Reduction from BMM to Independent Set Queries
- Reduction from BMM to ap-reach
- Reduction from Betweenness Centrality (BC) to Diameter
- Reduction from Betweenness Centrality (BC) to Directed, Weighted APSP
- Reduction from Betweenness Centrality (BC) to Undirected, Weighted APSP
- Reduction from Bichromatic Hamming Close Pair to Approximate Hard-Margin SVM
- Reduction from CFG Parsing to BMM
- Reduction from CNF-SAT to
- Reduction from CNF-SAT to Approximate Betweenness Centrality
- Reduction from CNF-SAT to Approximate Diameter
- Reduction from CNF-SAT to Approximate Reach Centrality
- Reduction from CNF-SAT to Dynamic 4/3-Diameter
- Reduction from CNF-SAT to Dynamic Connected Subgraph