Short pages
Jump to navigation
Jump to search
Showing below up to 250 results in range #1 to #250.
View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)
- (hist) Chromatic Polynomial [31 bytes]
- (hist) Reduction from OV to k-OV [135 bytes]
- (hist) Reduction from 3-OV to k-OV [141 bytes]
- (hist) Family:Page Replacements [170 bytes]
- (hist) Family:Nash Equilibria [171 bytes]
- (hist) Reduction from 3SUM to All-Integers 3SUM [177 bytes]
- (hist) Family:CFG Problems [178 bytes]
- (hist) Family:Recovery [178 bytes]
- (hist) Family:Graph Cycles [182 bytes]
- (hist) Family:Link Analysis [183 bytes]
- (hist) About Algorithm-Wiki [187 bytes]
- (hist) Family:Feature Detection [187 bytes]
- (hist) Family:Geometric Separator Problems [188 bytes]
- (hist) Family:Integer Factoring [189 bytes]
- (hist) Family:Graph Edit Distance Computation [191 bytes]
- (hist) Family:BCNF Decomposition [191 bytes]
- (hist) Family:Data Compression [193 bytes]
- (hist) Family:3SUM [193 bytes]
- (hist) Family:Integral Equations [194 bytes]
- (hist) Family:Local Alignment [194 bytes]
- (hist) Family:String Search [195 bytes]
- (hist) Family:Orthogonal Vectors [195 bytes]
- (hist) Family:Geometric Incidence Problems [200 bytes]
- (hist) Family:Sorting [201 bytes]
- (hist) Family:Deadlock Avoidance [203 bytes]
- (hist) Family:Minimum Witness [203 bytes]
- (hist) Family:One-Way Hash Functions [204 bytes]
- (hist) Family:Motion Planning Problems [204 bytes]
- (hist) Family:SDD Systems Solvers [205 bytes]
- (hist) Family:Wiener Index [207 bytes]
- (hist) Family:The Set-Covering Problem [208 bytes]
- (hist) Family:Generating Random Permutations [209 bytes]
- (hist) Family:Register Allocation [210 bytes]
- (hist) Family:Poisson Problem [213 bytes]
- (hist) Family:The Traveling-Salesman Problem [214 bytes]
- (hist) Family:Integer Relation [215 bytes]
- (hist) Family:Graph Realization Problems [216 bytes]
- (hist) Family:Texture Mapping [218 bytes]
- (hist) Family:Maximum-Weight Matching [219 bytes]
- (hist) Family:AST to Code Translation [219 bytes]
- (hist) Incremental Heuristic Search ( Informed Search) [220 bytes]
- (hist) Family:LU Decomposition [221 bytes]
- (hist) (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull) [221 bytes]
- (hist) Family:n-Queens Problem [222 bytes]
- (hist) Tradu; Mirc ( 4NF Decomposition) [222 bytes]
- (hist) Derek's Algorithm ( 4NF Decomposition) [222 bytes]
- (hist) Xu; Renio ( 4NF Decomposition) [222 bytes]
- (hist) Russell et. al. ( 4NF Decomposition) [222 bytes]
- (hist) Maxwell ( 4NF Decomposition) [222 bytes]
- (hist) Derek's + Maxwell ( 4NF Decomposition) [222 bytes]
- (hist) Naive ( 4NF Decomposition) [222 bytes]
- (hist) Trino ( 4NF Decomposition) [222 bytes]
- (hist) YAN J. Q.; YANG X.; SHI P. F 2006 (Mesh Parameterization Mesh Parameterization) [222 bytes]
- (hist) Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) [222 bytes]
- (hist) Cooper and Dasgupta algorithm ( Register Allocation) [222 bytes]
- (hist) B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) [222 bytes]
- (hist) Naive Implementation ( Integral Equations) [222 bytes]
- (hist) Record linking (Entity Resolution Entity Resolution) [223 bytes]
- (hist) Family:Line Clipping [225 bytes]
- (hist) Sorting based (Merge Sort) + real-time elimination (Duplicate Elimination Duplicate Elimination) [225 bytes]
- (hist) Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination) [225 bytes]
- (hist) V. I. Paasonen 1968 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) [227 bytes]
- (hist) Family:Root Computation [229 bytes]
- (hist) YANG Y.; KIM J.; LUO F.; HU S.; GU X. 2008 (Mesh Parameterization Mesh Parameterization) [229 bytes]
- (hist) V. I. Paasonen (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) [229 bytes]
- (hist) Family:Dihedral Rotation Queries [230 bytes]
- (hist) Work-conserving schedulers (Unweighted Interval Scheduling, Online?? Interval Scheduling) [231 bytes]
- (hist) Work-conserving schedulers (Unweighted Interval Scheduling, Online Interval Scheduling) [231 bytes]
- (hist) Family:Sequence Alignment [232 bytes]
- (hist) Nauck (Counting Solutions; Constructing solutions n-Queens Problem) [232 bytes]
- (hist) Family:Longest Common Subsequence [233 bytes]
- (hist) Family:The Vertex Cover Problem [234 bytes]
- (hist) Closed formula ( LU Decomposition) [235 bytes]
- (hist) David ( LU Decomposition) [235 bytes]
- (hist) Hybrid Algorithm (De Novo Genome Assembly De Novo Genome Assembly) [235 bytes]
- (hist) Hadlock (Maximum Cut Maximum Cut) [235 bytes]
- (hist) Pratt (Constructing Suffix Trees Constructing Suffix Trees) [235 bytes]
- (hist) Closed formula (Square Matrix LU Decomposition LU Decomposition) [238 bytes]
- (hist) David (Square Matrix LU Decomposition LU Decomposition) [238 bytes]
- (hist) Family:DFA Minimization [242 bytes]
- (hist) Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Vertex clustering - Rossignac; J. and Borrel; P. 1993 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Vertex clustering - Low; K. L. and Tan; T. S 1997 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Vertex clustering - Reddy 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Vertex clustering - Hoppe; H.; DeRose; T.; 1993 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Vertex clustering - Rossignac; J. and Borrel; P. 1997 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Simplification via intermediate hierarchical rep-resentation - Andujar 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; L.; Kaufman 1995 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; 1996 (Mesh Simplification Mesh Simplification) [242 bytes]
- (hist) Hauskrecht; 2000; (POMDPs POMDPs) [242 bytes]
- (hist) Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs) [242 bytes]
- (hist) Braziunas & Boutilier; 2004; (POMDPs POMDPs) [242 bytes]
- (hist) Poupart; 2005; (POMDPs POMDPs) [242 bytes]
- (hist) Smith & Simmons; 2005; (POMDPs POMDPs) [242 bytes]
- (hist) Spaan & Vlassis; 2005 (POMDPs POMDPs) [242 bytes]
- (hist) Satia & Lave; 1973; (POMDPs POMDPs) [242 bytes]
- (hist) Washington; 1997; (POMDPs POMDPs) [242 bytes]
- (hist) Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) [242 bytes]
- (hist) Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs) [242 bytes]
- (hist) McAllester & Singh; 1999; (POMDPs POMDPs) [242 bytes]
- (hist) Bertsekas & Castanon; 1999; (POMDPs POMDPs) [242 bytes]
- (hist) Shani; Brafman; & Shimony; 2005 (POMDPs POMDPs) [242 bytes]
- (hist) Chen Ensembles of classifiers (Entity Resolution Entity Resolution) [242 bytes]
- (hist) Family:Geometric Visibility Problems [243 bytes]
- (hist) Blinn and Newell (Environment Mapping Texture Mapping) [243 bytes]
- (hist) Sphere mapping (Environment Mapping Texture Mapping) [243 bytes]
- (hist) Mauro Steigleder (Environment Mapping Texture Mapping) [243 bytes]
- (hist) Brute force ( The Set-Covering Problem) [243 bytes]
- (hist) Sparse APSP algorithm (Arbitrary edge weights, Sparse graph Graph Diameter) [243 bytes]
- (hist) Family:Matrix-Vector Multiplication [245 bytes]
- (hist) Schubert's algorithm ( Factorization of Polynomials Over Finite Fields) [245 bytes]
- (hist) Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion) [246 bytes]
- (hist) Family:Dependency Inference Problem [247 bytes]
- (hist) Family:Polygon Clipping [249 bytes]
- (hist) Bucket Sort (Non-Comparison Sorting Sorting) [249 bytes]
- (hist) Tarjan Splay Tree ( Self-Balancing Trees Insertion) [249 bytes]
- (hist) Tarjan Splay Tree ( Self-Balancing Trees Deletion) [249 bytes]
- (hist) Tarjan Splay Tree ( Self-Balancing Trees Search) [249 bytes]
- (hist) Family:Maximum Cardinality Matching [250 bytes]
- (hist) Shortest remaining time first (Unweighted Interval Scheduling, Online?? Interval Scheduling) [250 bytes]
- (hist) First come, first served (Unweighted Interval Scheduling, Online?? Interval Scheduling) [250 bytes]
- (hist) Round-robin scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) [250 bytes]
- (hist) Shortest remaining time first (Unweighted Interval Scheduling, Online Interval Scheduling) [250 bytes]
- (hist) First come, first served (Unweighted Interval Scheduling, Online Interval Scheduling) [250 bytes]
- (hist) Round-robin scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) [250 bytes]
- (hist) The SUSAN corner detector ( Corner Detection) [252 bytes]
- (hist) Dürer rendering algorithm ( Ray Tracing) [252 bytes]
- (hist) A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing) [252 bytes]
- (hist) Lindeberg (1994) (Corner Detection Feature Detection) [252 bytes]
- (hist) T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection) [252 bytes]
- (hist) Lindeberg 2005 (Corner Detection Feature Detection) [252 bytes]
- (hist) The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection) [252 bytes]
- (hist) Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection) [252 bytes]
- (hist) T. Lindeberg DoG 2012 (Blob Detection Feature Detection) [252 bytes]
- (hist) SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection) [252 bytes]
- (hist) Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection) [252 bytes]
- (hist) Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection) [252 bytes]
- (hist) SURF Descriptor 2006 (Blob Detection Feature Detection) [252 bytes]
- (hist) Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection) [252 bytes]
- (hist) Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection) [252 bytes]
- (hist) Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection) [252 bytes]
- (hist) A. Baumberg. 2000 (Blob Detection Feature Detection) [252 bytes]
- (hist) Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) [252 bytes]
- (hist) T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection) [252 bytes]
- (hist) View frustum culling (Culling Culling) [252 bytes]
- (hist) Sector-Based Culling (Culling Culling) [252 bytes]
- (hist) Occlusion Culling (Culling Culling) [252 bytes]
- (hist) Contribution Culling (Culling Culling) [252 bytes]
- (hist) CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) [252 bytes]
- (hist) Phong (Specular Reflection Texture Mapping) [252 bytes]
- (hist) Blinn–Phong (Specular Reflection Texture Mapping) [252 bytes]
- (hist) Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) [252 bytes]
- (hist) Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation) [252 bytes]
- (hist) Recursive Region Splitting ( Image Segmentation) [252 bytes]
- (hist) R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation) [252 bytes]
- (hist) Kass; Witkin and Terzopoulos ( Image Segmentation) [252 bytes]
- (hist) S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation) [252 bytes]
- (hist) David Mumford and Jayant Shah (1989) ( Image Segmentation) [252 bytes]
- (hist) Geman and Geman Markov random fields ( Image Segmentation) [252 bytes]
- (hist) Iterated conditional modes algorithm ( Image Segmentation) [252 bytes]
- (hist) Watershed transformation 1979 ( Image Segmentation) [252 bytes]
- (hist) Topological watershed ( Image Segmentation) [252 bytes]
- (hist) Florack and Kuijper ( Image Segmentation) [252 bytes]
- (hist) Bijaoui and Rué ( Image Segmentation) [252 bytes]
- (hist) Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation) [252 bytes]
- (hist) Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation) [252 bytes]
- (hist) Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation) [252 bytes]
- (hist) Nate Green (Environment Mapping Texture Mapping) [252 bytes]
- (hist) Heidrich; W.; and H.-P. Seidel (Environment Mapping Texture Mapping) [252 bytes]
- (hist) Emil Praun (Environment Mapping Texture Mapping) [252 bytes]
- (hist) HEALPix mapping Wong (Environment Mapping Texture Mapping) [252 bytes]
- (hist) Maximum a Posteriori Occupancy Mapping (Occupancy Grid Mapping Occupancy Grid Mapping) [252 bytes]
- (hist) AVL Tree ( Self-Balancing Trees Deletion) [252 bytes]
- (hist) The SUSAN corner detector (Corner Detection Feature Detection) [252 bytes]
- (hist) Zykov (deletion-contraction) ( Chromatic Polynomial) [253 bytes]
- (hist) P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) [254 bytes]
- (hist) H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) [254 bytes]
- (hist) He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) [254 bytes]
- (hist) Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) [254 bytes]
- (hist) Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) [254 bytes]
- (hist) Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) [254 bytes]
- (hist) Hopcroft 2-3 Tree ( Self-Balancing Trees Deletion) [254 bytes]
- (hist) IDEA (Block Ciphers Block Ciphers) [254 bytes]
- (hist) Random (Online Page Replacements) [254 bytes]
- (hist) Family:Maximum Subarray Problem [255 bytes]
- (hist) Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem) [255 bytes]
- (hist) T. Lindeberg DoG 2015 (Blob Detection Feature Detection) [255 bytes]
- (hist) Barghout; Lauren Visual Taxometric approach ( Image Segmentation) [255 bytes]
- (hist) Dual clustering - Guberman ( Image Segmentation) [255 bytes]
- (hist) Chen's lambda-connected segmentation ( Image Segmentation) [255 bytes]
- (hist) Quasi-linear Topological watershed ( Image Segmentation) [255 bytes]
- (hist) Dense APSP algorithm (Arbitrary edge weights, Dense graph Graph Diameter) [255 bytes]
- (hist) C-SCAN (Disk Scheduling Disk Scheduling) [256 bytes]
- (hist) C-LOOK (Disk Scheduling Disk Scheduling) [256 bytes]
- (hist) APSP algorithm (3-Clique Min-Weight k-Clique Problem) [256 bytes]
- (hist) Brute Force (Rod-Cutting Problem Rod-Cutting Problem) [257 bytes]
- (hist) Brute Force (Change-Making Problem Change-Making Problem) [258 bytes]
- (hist) Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) [258 bytes]
- (hist) Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication) [259 bytes]
- (hist) Hanrahan–Krueger (Specular Reflection Texture Mapping) [259 bytes]
- (hist) Ullman (Subgraph Isomorphism Graph Isomorphism Problem) [259 bytes]
- (hist) Schöning (3-Graph Coloring Graph Coloring) [260 bytes]
- (hist) Radix Sort (Non-Comparison Sorting Sorting) [261 bytes]
- (hist) LU decomposition (General Linear system of equations) [261 bytes]
- (hist) V. A. Lyul’ka and A. V. Romanenko 1994 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) [261 bytes]
- (hist) Textbook Sort-and-Two-Sided-Traversal (Integer 3SUM 3SUM) [261 bytes]
- (hist) V. A. Lyul’ka and A. V. Romanenko (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) [261 bytes]
- (hist) Naive sorting (Non-Comparison Sorting Sorting) [262 bytes]
- (hist) The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection) [262 bytes]
- (hist) Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection) [262 bytes]
- (hist) Förstner algorithm 1987 (Corner Detection Feature Detection) [263 bytes]
- (hist) Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection) [263 bytes]
- (hist) Naive sorting (Comparison Sorting Sorting) [264 bytes]
- (hist) Selection Sort (Comparison Sorting Sorting) [264 bytes]
- (hist) Bubble Sort (Comparison Sorting Sorting) [264 bytes]
- (hist) Lund & Yannakakis ( The Set-Covering Problem) [264 bytes]
- (hist) Bayer, McCreight B-Tree ( Self-Balancing Trees Search) [264 bytes]
- (hist) Brute Force (2-dimensional Convex Hull) [266 bytes]
- (hist) Laguerre iteration (Any eigenvalue Eigenvalues (Iterative Methods)) [266 bytes]
- (hist) Hashing (kth Order Statistic kth Order Statistic) [267 bytes]
- (hist) Ray tracing ( Shown Surface Determination) [267 bytes]
- (hist) ZAYER R.; LÉVY B.; SEIDEL H.-P. 2007 (Mesh Parameterization Mesh Parameterization) [267 bytes]
- (hist) BFS/DFS for connected components ( [267 bytes]
- (hist) Textbook Sort-and-Binary-Search (Integer 3SUM 3SUM) [267 bytes]
- (hist) Naive (Reporting all intersection points, line segments Line segment intersection) [268 bytes]
- (hist) Ward anisotropic (Specular Reflection Texture Mapping) [268 bytes]
- (hist) Mucha and Sankowski ( Maximum-Weight Matching) [268 bytes]
- (hist) Conflict-Driven Clause Learning (CDCL) (CNF-SAT Boolean Satisfiability) [268 bytes]
- (hist) Naive Implementation (k-dimensional space, l m (or l infty) norm Closest Pair Problem) [269 bytes]
- (hist) Tim Sort (Comparison Sorting Sorting) [269 bytes]
- (hist) S-buffer/Scanline Rendering ( Shown Surface Determination) [269 bytes]
- (hist) Catriel Beeri Ronald Fagin John H. Howard (Multivalued Dependency Inference Problem Dependency Inference Problem) [269 bytes]
- (hist) DESBRUN M.; MEYER M.; ALLIEZ P. 2002 (Mesh Parameterization Mesh Parameterization) [269 bytes]
- (hist) SHEFFER A.; LÉVY B.; MOGILNITSKY M.; BOGOMYAKOV A. 2005 (Mesh Parameterization Mesh Parameterization) [269 bytes]
- (hist) O'Neil 1973 (Boolean Matrix Multiplication Matrix Product) [269 bytes]
- (hist) ECK M.; DEROSE T.; DUCHAMP T.; 1995 (Mesh Parameterization Mesh Parameterization) [269 bytes]
- (hist) Family:Optimal Binary Search Trees [270 bytes]