Oldest pages
Jump to navigation
Jump to search
Showing below up to 50 results in range #251 to #300.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Image Compositing (11:25, 15 February 2023)
- Diffuse Reflection (11:25, 15 February 2023)
- Mesh Simplification (11:25, 15 February 2023)
- POMDPs (11:25, 15 February 2023)
- Rasterization (11:25, 15 February 2023)
- Environment Mapping (11:25, 15 February 2023)
- Occupancy Grid Mapping (11:25, 15 February 2023)
- Fredholm Equations (11:26, 15 February 2023)
- Volterra Equations (11:26, 15 February 2023)
- Steal/No-Force (11:26, 15 February 2023)
- No-Steal/Force (11:26, 15 February 2023)
- Chromatic Polynomial (11:27, 15 February 2023)
- Maximum Inner Product Search (11:30, 15 February 2023)
- Approximate Hard-Margin SVM (11:30, 15 February 2023)
- Exponential Time Hypothesis (ETH) (11:30, 15 February 2023)
- Strong Exponential Time Hypothesis (SETH) (11:30, 15 February 2023)
- Orthogonal Vectors Hypothesis (OVH) (11:30, 15 February 2023)
- Unbalanced Orthogonal Vectors Hypothesis (UOVH) (11:30, 15 February 2023)
- K-OV Hypothesis (11:30, 15 February 2023)
- K-Clique Hypothesis (11:30, 15 February 2023)
- 3SUM Hypothesis (3-SUM Hypothesis) (11:30, 15 February 2023)
- All Pairs Shortest Paths Hypothesis (APSP Hypothesis) (11:30, 15 February 2023)
- Hitting Set Hypothesis (HS Hypothesis) (11:30, 15 February 2023)
- Min-Weight k-Clique Hypothesis (11:30, 15 February 2023)
- Exact k-Clique Hypothesis (11:30, 15 February 2023)
- Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) (11:30, 15 February 2023)
- Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis) (11:30, 15 February 2023)
- Nondeterministic Strong Exponential Time Hypothesis (NSETH) (11:30, 15 February 2023)
- More Believable Exponential Time Hypothesis (MBETH) (11:30, 15 February 2023)
- Strong Triangle Conjecture (11:30, 15 February 2023)
- $\delta$-Triangle Conjecture (11:31, 15 February 2023)
- Parametrized Inapproximability Hypothesis (PIH) (11:31, 15 February 2023)
- Weak Parametrized Inapproximability Hypothesis (WPIH) (11:31, 15 February 2023)
- Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) (11:31, 15 February 2023)
- Karpinski (Approximate OBST Optimal Binary Search Trees) (11:31, 15 February 2023)
- Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees) (11:31, 15 February 2023)
- Larmore (Approximate OBST Optimal Binary Search Trees) (11:31, 15 February 2023)
- Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (11:31, 15 February 2023)
- Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (11:31, 15 February 2023)
- Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search) (11:31, 15 February 2023)
- Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (11:31, 15 February 2023)
- Pisinger (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Faaland (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Pferschy (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Klinz (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Epstein (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Lokshtanov (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem) (11:31, 15 February 2023)
- Lawrence, Reilly (Motif Search Motif Search) (11:31, 15 February 2023)
- Lawrence Gibbs Sampling (Motif Search Motif Search) (11:31, 15 February 2023)