Short pages

Jump to navigation Jump to search

Showing below up to 100 results in range #51 to #150.

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)

  1. (hist) ‎Naive ( 4NF Decomposition) ‎[222 bytes]
  2. (hist) ‎Trino ( 4NF Decomposition) ‎[222 bytes]
  3. (hist) ‎YAN J. Q.; YANG X.; SHI P. F 2006 (Mesh Parameterization Mesh Parameterization) ‎[222 bytes]
  4. (hist) ‎Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[222 bytes]
  5. (hist) ‎Cooper and Dasgupta algorithm ( Register Allocation) ‎[222 bytes]
  6. (hist) ‎B. I. Kvasov 2000 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[222 bytes]
  7. (hist) ‎Naive Implementation ( Integral Equations) ‎[222 bytes]
  8. (hist) ‎Record linking (Entity Resolution Entity Resolution) ‎[223 bytes]
  9. (hist) ‎Family:Line Clipping ‎[225 bytes]
  10. (hist) ‎Sorting based (Merge Sort) + real-time elimination (Duplicate Elimination Duplicate Elimination) ‎[225 bytes]
  11. (hist) ‎Duplicate Elimination Sorted Neighborhood Algorithm (DE-SNA) (Duplicate Elimination Duplicate Elimination) ‎[225 bytes]
  12. (hist) ‎V. I. Paasonen 1968 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[227 bytes]
  13. (hist) ‎Family:Root Computation ‎[229 bytes]
  14. (hist) ‎YANG Y.; KIM J.; LUO F.; HU S.; GU X. 2008 (Mesh Parameterization Mesh Parameterization) ‎[229 bytes]
  15. (hist) ‎V. I. Paasonen (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[229 bytes]
  16. (hist) ‎Family:Dihedral Rotation Queries ‎[230 bytes]
  17. (hist) ‎Work-conserving schedulers (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[231 bytes]
  18. (hist) ‎Work-conserving schedulers (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[231 bytes]
  19. (hist) ‎Family:Sequence Alignment ‎[232 bytes]
  20. (hist) ‎Nauck (Counting Solutions; Constructing solutions n-Queens Problem) ‎[232 bytes]
  21. (hist) ‎Family:Longest Common Subsequence ‎[233 bytes]
  22. (hist) ‎Family:The Vertex Cover Problem ‎[234 bytes]
  23. (hist) ‎Closed formula ( LU Decomposition) ‎[235 bytes]
  24. (hist) ‎David ( LU Decomposition) ‎[235 bytes]
  25. (hist) ‎Hybrid Algorithm (De Novo Genome Assembly De Novo Genome Assembly) ‎[235 bytes]
  26. (hist) ‎Hadlock (Maximum Cut Maximum Cut) ‎[235 bytes]
  27. (hist) ‎Pratt (Constructing Suffix Trees Constructing Suffix Trees) ‎[235 bytes]
  28. (hist) ‎Closed formula (Square Matrix LU Decomposition LU Decomposition) ‎[238 bytes]
  29. (hist) ‎David (Square Matrix LU Decomposition LU Decomposition) ‎[238 bytes]
  30. (hist) ‎Family:DFA Minimization ‎[242 bytes]
  31. (hist) ‎Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  32. (hist) ‎Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  33. (hist) ‎Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  34. (hist) ‎Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  35. (hist) ‎Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  36. (hist) ‎Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  37. (hist) ‎Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  38. (hist) ‎Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  39. (hist) ‎Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  40. (hist) ‎Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  41. (hist) ‎Vertex clustering - Rossignac; J. and Borrel; P. 1993 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  42. (hist) ‎Vertex clustering - Low; K. L. and Tan; T. S 1997 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  43. (hist) ‎Vertex clustering - Reddy 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  44. (hist) ‎Vertex clustering - Hoppe; H.; DeRose; T.; 1993 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  45. (hist) ‎Vertex clustering - Rossignac; J. and Borrel; P. 1997 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  46. (hist) ‎Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  47. (hist) ‎Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  48. (hist) ‎Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  49. (hist) ‎Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  50. (hist) ‎Simplification via intermediate hierarchical rep-resentation - Andujar 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  51. (hist) ‎Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; L.; Kaufman 1995 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  52. (hist) ‎Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; 1996 (Mesh Simplification Mesh Simplification) ‎[242 bytes]
  53. (hist) ‎Hauskrecht; 2000; (POMDPs POMDPs) ‎[242 bytes]
  54. (hist) ‎Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs) ‎[242 bytes]
  55. (hist) ‎Braziunas & Boutilier; 2004; (POMDPs POMDPs) ‎[242 bytes]
  56. (hist) ‎Poupart; 2005; (POMDPs POMDPs) ‎[242 bytes]
  57. (hist) ‎Smith & Simmons; 2005; (POMDPs POMDPs) ‎[242 bytes]
  58. (hist) ‎Spaan & Vlassis; 2005 (POMDPs POMDPs) ‎[242 bytes]
  59. (hist) ‎Satia & Lave; 1973; (POMDPs POMDPs) ‎[242 bytes]
  60. (hist) ‎Washington; 1997; (POMDPs POMDPs) ‎[242 bytes]
  61. (hist) ‎Barto;Bradtke; & Singhe; 1995; (POMDPs POMDPs) ‎[242 bytes]
  62. (hist) ‎Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs) ‎[242 bytes]
  63. (hist) ‎McAllester & Singh; 1999; (POMDPs POMDPs) ‎[242 bytes]
  64. (hist) ‎Bertsekas & Castanon; 1999; (POMDPs POMDPs) ‎[242 bytes]
  65. (hist) ‎Shani; Brafman; & Shimony; 2005 (POMDPs POMDPs) ‎[242 bytes]
  66. (hist) ‎Chen Ensembles of classifiers (Entity Resolution Entity Resolution) ‎[242 bytes]
  67. (hist) ‎Family:Geometric Visibility Problems ‎[243 bytes]
  68. (hist) ‎Blinn and Newell (Environment Mapping Texture Mapping) ‎[243 bytes]
  69. (hist) ‎Sphere mapping (Environment Mapping Texture Mapping) ‎[243 bytes]
  70. (hist) ‎Mauro Steigleder (Environment Mapping Texture Mapping) ‎[243 bytes]
  71. (hist) ‎Brute force ( The Set-Covering Problem) ‎[243 bytes]
  72. (hist) ‎Sparse APSP algorithm (Arbitrary edge weights, Sparse graph Graph Diameter) ‎[243 bytes]
  73. (hist) ‎Family:Matrix-Vector Multiplication ‎[245 bytes]
  74. (hist) ‎Schubert's algorithm ( Factorization of Polynomials Over Finite Fields) ‎[245 bytes]
  75. (hist) ‎Dekker's algorithm (2-thread Mutual Exclusion Mutual Exclusion) ‎[246 bytes]
  76. (hist) ‎Family:Dependency Inference Problem ‎[247 bytes]
  77. (hist) ‎Family:Polygon Clipping ‎[249 bytes]
  78. (hist) ‎Bucket Sort (Non-Comparison Sorting Sorting) ‎[249 bytes]
  79. (hist) ‎Tarjan Splay Tree ( Self-Balancing Trees Insertion) ‎[249 bytes]
  80. (hist) ‎Tarjan Splay Tree ( Self-Balancing Trees Deletion) ‎[249 bytes]
  81. (hist) ‎Tarjan Splay Tree ( Self-Balancing Trees Search) ‎[249 bytes]
  82. (hist) ‎Family:Maximum Cardinality Matching ‎[250 bytes]
  83. (hist) ‎Shortest remaining time first (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[250 bytes]
  84. (hist) ‎First come, first served (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[250 bytes]
  85. (hist) ‎Round-robin scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[250 bytes]
  86. (hist) ‎Shortest remaining time first (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[250 bytes]
  87. (hist) ‎First come, first served (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[250 bytes]
  88. (hist) ‎Round-robin scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[250 bytes]
  89. (hist) ‎The SUSAN corner detector ( Corner Detection) ‎[252 bytes]
  90. (hist) ‎Dürer rendering algorithm ( Ray Tracing) ‎[252 bytes]
  91. (hist) ‎A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing) ‎[252 bytes]
  92. (hist) ‎Lindeberg (1994) (Corner Detection Feature Detection) ‎[252 bytes]
  93. (hist) ‎T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection) ‎[252 bytes]
  94. (hist) ‎Lindeberg 2005 (Corner Detection Feature Detection) ‎[252 bytes]
  95. (hist) ‎The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection) ‎[252 bytes]
  96. (hist) ‎Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection) ‎[252 bytes]
  97. (hist) ‎T. Lindeberg DoG 2012 (Blob Detection Feature Detection) ‎[252 bytes]
  98. (hist) ‎SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection) ‎[252 bytes]
  99. (hist) ‎Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection) ‎[252 bytes]
  100. (hist) ‎Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection) ‎[252 bytes]

View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:ShortPages"