Pages with the fewest revisions

Jump to navigation Jump to search

Showing below up to 50 results in range #551 to #600.

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

  1. Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping)‏‎ (1 revision)
  2. Wen (2-dimensional Maximum subarray problem)‏‎ (1 revision)
  3. Wen (1-dimensional Maximum subarray problem)‏‎ (1 revision)
  4. Wells ( All permutations)‏‎ (1 revision)
  5. Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees)‏‎ (1 revision)
  6. Weighted Activity selection problem‏‎ (1 revision)
  7. Weak Parametrized Inapproximability Hypothesis (WPIH)‏‎ (1 revision)
  8. Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification)‏‎ (1 revision)
  9. Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification)‏‎ (1 revision)
  10. Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification)‏‎ (1 revision)
  11. Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification)‏‎ (1 revision)
  12. Watershed transformation 1979 ( Image Segmentation)‏‎ (1 revision)
  13. Washington; 1997; (POMDPs POMDPs)‏‎ (1 revision)
  14. Warnock's algorithm ( Shown Surface Determination)‏‎ (1 revision)
  15. WalkSAT (CNF-SAT Boolean Satisfiability)‏‎ (1 revision)
  16. Wagner-Fischer algorithm (Edit sequence Sequence Alignment)‏‎ (1 revision)
  17. Wagner-Fischer algorithm (Edit sequence, constant-size alphabet Sequence Alignment)‏‎ (1 revision)
  18. Wagner-Fischer algorithm (Edit distance Sequence Alignment)‏‎ (1 revision)
  19. Wagner-Fischer algorithm (Edit distance, constant-size alphabet Sequence Alignment)‏‎ (1 revision)
  20. Wagner-Fischer Algorithm‏‎ (1 revision)
  21. W. Eddy Quickhull (2-dimensional Convex Hull)‏‎ (1 revision)
  22. Vornoi Diagrams‏‎ (1 revision)
  23. Volterra Equations‏‎ (1 revision)
  24. View frustum culling (Culling Culling)‏‎ (1 revision)
  25. Victor Shoup's algorithm (Equal-degree Factorization of Polynomials Over Finite Fields)‏‎ (1 revision)
  26. Tradu; Mirc ( 4NF Decomposition)‏‎ (1 revision)
  27. Turnpike problem‏‎ (1 revision)
  28. Tuned Boyer-Moore algorithm (Single String Search String Search)‏‎ (1 revision)
  29. Trujillo and Olague 2008 (Corner Detection Feature Detection)‏‎ (1 revision)
  30. Trino ( 4NF Decomposition)‏‎ (1 revision)
  31. Trial Multiplication (Discrete Logarithm Over Finite Fields Logarithm Calculations)‏‎ (1 revision)
  32. Tree-structured vector quantization Wei-Levoy (Texture Synthesis Texture Synthesis)‏‎ (1 revision)
  33. Treap ( Self-Balancing Trees Search)‏‎ (1 revision)
  34. Treap ( Self-Balancing Trees Insertion)‏‎ (1 revision)
  35. Treap ( Self-Balancing Trees Deletion)‏‎ (1 revision)
  36. Treap ( Self-Balancing Trees Creation)‏‎ (1 revision)
  37. Translating abstract syntax trees‏‎ (1 revision)
  38. Transitive Reduction problem‏‎ (1 revision)
  39. Todd–Coxeter algorithm (Bounded Subgroup Index Coset Enumeration)‏‎ (1 revision)
  40. Theta* (Informed Search Informed Search)‏‎ (1 revision)
  41. Thorup's algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs))‏‎ (1 revision)
  42. Thorup (positive integer weights; assumes constant-time multiplication Shortest Path (Undirected graphs))‏‎ (1 revision)
  43. Tim Sort (Comparison Sorting Sorting)‏‎ (1 revision)
  44. Time-Bounded A* (TBA*) (Informed Search Informed Search)‏‎ (1 revision)
  45. Todd–Coxeter algorithm‏‎ (1 revision)
  46. Tompa M (Motif Search Motif Search)‏‎ (1 revision)
  47. Topological watershed ( Image Segmentation)‏‎ (1 revision)
  48. Tompa M ( Motif Search)‏‎ (1 revision)
  49. Tushar Deepak Chandra and Sam Toueg (Distributed Locking Algorithms Distributed Locking Algorithms)‏‎ (1 revision)
  50. Tomlin (Link Analysis Link Analysis)‏‎ (1 revision)

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