New pages

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

• 10:40, 15 February 2023 ‎Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) (hist | edit) ‎[254 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1992 == Reference ==")
• 10:40, 15 February 2023 ‎Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) (hist | edit) ‎[254 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference ==")
• 10:40, 15 February 2023 ‎Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) (hist | edit) ‎[258 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(k^{3} n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference ==")
• 10:40, 15 February 2023 ‎Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) (hist | edit) ‎[254 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1985 == Reference ==")
• 10:40, 15 February 2023 ‎He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) (hist | edit) ‎[254 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
• 10:40, 15 February 2023 ‎H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) (hist | edit) ‎[254 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(k^{3} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==")
• 10:40, 15 February 2023 ‎P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) (hist | edit) ‎[254 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(k n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1993 == Reference ==")
• 10:40, 15 February 2023 ‎CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2001 == Reference ==")
• 10:40, 15 February 2023 ‎Kwatra 2003 (Texture Synthesis Texture Synthesis) (hist | edit) ‎[303 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference == https://dl.acm.org/doi/abs/10.1145/882262.882264")
• 10:40, 15 February 2023 ‎Contribution Culling (Culling Culling) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1987 == Reference ==")
• 10:40, 15 February 2023 ‎Occlusion Culling (Culling Culling) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1986 == Reference ==")
• 10:40, 15 February 2023 ‎Sector-Based Culling (Culling Culling) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
• 10:40, 15 February 2023 ‎View frustum culling (Culling Culling) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference ==")
• 10:40, 15 February 2023 ‎T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
• 10:40, 15 February 2023 ‎Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference ==")
• 10:40, 15 February 2023 ‎Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection) (hist | edit) ‎[263 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} loglogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
• 10:40, 15 February 2023 ‎A. Baumberg. 2000 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference ==")
• 10:40, 15 February 2023 ‎Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection) (hist | edit) ‎[262 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} log^{3} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference ==")
• 10:40, 15 February 2023 ‎Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1991 == Reference ==")
• 10:40, 15 February 2023 ‎Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference ==")
• 10:40, 15 February 2023 ‎Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==")
• 10:40, 15 February 2023 ‎SURF Descriptor 2006 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference ==")
• 10:40, 15 February 2023 ‎Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1998 == Reference ==")
• 10:40, 15 February 2023 ‎Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference ==")
• 10:40, 15 February 2023 ‎SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference ==")
• 10:40, 15 February 2023 ‎T. Lindeberg DoG 2015 (Blob Detection Feature Detection) (hist | edit) ‎[255 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2015 == Reference ==")
• 10:40, 15 February 2023 ‎T. Lindeberg DoG 2012 (Blob Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2012 == Reference ==")
• 10:40, 15 February 2023 ‎Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2019 == Reference ==")
• 10:40, 15 February 2023 ‎Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection) (hist | edit) ‎[319 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference == http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.471.6845")
• 10:40, 15 February 2023 ‎Trujillo and Olague 2008 (Corner Detection Feature Detection) (hist | edit) ‎[351 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference == https://www.mitpressjournals.org/doi/abs/10.1162/evco.2008.16.4.483?journalCode=evco&mobileUi=0&")
• 10:40, 15 February 2023 ‎FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection) (hist | edit) ‎[312 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://www.edwardrosten.com/work/rosten_2006_machine.pdf")
• 10:40, 15 February 2023 ‎The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection) (hist | edit) ‎[262 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} log^{2} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1998 == Reference ==")
• 10:40, 15 February 2023 ‎The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1995 == Reference ==")
• 10:39, 15 February 2023 ‎Lindeberg 2005 (Corner Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2005 == Reference ==")
• 10:39, 15 February 2023 ‎T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference ==")
• 10:39, 15 February 2023 ‎Lowe (2004) (Corner Detection Feature Detection) (hist | edit) ‎[300 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference == https://www.cs.ubc.ca/~lowe/papers/ijcv04.pdf")
• 10:39, 15 February 2023 ‎K. Mikolajczyk; K. and C. Schmid LoG 2004 (Corner Detection Feature Detection) (hist | edit) ‎[343 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2004 == Reference == https://www.robots.ox.ac.uk/~vgg/research/affine/det_eval_files/mikolajczyk_pami2004.pdf")
• 10:39, 15 February 2023 ‎Lindeberg (1998) (Corner Detection Feature Detection) (hist | edit) ‎[312 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1998 == Reference == https://link.springer.com/article/10.1023/A:1008045108935")
• 10:39, 15 February 2023 ‎Lindeberg (1994) (Corner Detection Feature Detection) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference ==")
• 10:39, 15 February 2023 ‎J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection) (hist | edit) ‎[322 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1988 == Reference == https://www.osapublishing.org/josaa/abstract.cfm?uri=josaa-5-7-1136")
• 10:39, 15 February 2023 ‎Förstner algorithm 1987 (Corner Detection Feature Detection) (hist | edit) ‎[263 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} log^{2} n)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1987 == Reference ==")
• 10:39, 15 February 2023 ‎Moravec's algorithm 1980 (Corner Detection Feature Detection) (hist | edit) ‎[336 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1980 == Reference == https://www.ri.cmu.edu/pub_files/pub4/moravec_hans_1980_1/moravec_hans_1980_1.pdf")
• 10:39, 15 February 2023 ‎A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference ==")
• 10:39, 15 February 2023 ‎J.-C. Nebel 1998 ( Ray Tracing) (hist | edit) ‎[348 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1998 == Reference == https://www.academia.edu/814419/A_New_Parallel_Algorithm_Provided_by_a_Computation_Time_Model")
• 10:39, 15 February 2023 ‎Whitted's algorithm 1979 ( Ray Tracing) (hist | edit) ‎[299 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1979 == Reference == https://dl.acm.org/doi/10.1145/358876.358882")
• 10:39, 15 February 2023 ‎Appel's algorithm 1968 ( Ray Tracing) (hist | edit) ‎[301 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1968 == Reference == https://dl.acm.org/doi/10.1145/1468075.1468082")
• 10:39, 15 February 2023 ‎Dürer rendering algorithm ( Ray Tracing) (hist | edit) ‎[252 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1956 == Reference ==")
• 10:39, 15 February 2023 ‎Greedy SEQAID (De Novo Genome Assembly De Novo Genome Assembly) (hist | edit) ‎[478 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$? == Space Complexity == $O(n^{2})$? words (Computes and stores all acceptable overlaps among all fragment pairs, along with detailed information regarding alignment, during one of the steps) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1984 == Reference == https://www.ncbi.nlm.nih.gov/pmc/articles/PMC321006/")
• 10:39, 15 February 2023 ‎Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly) (hist | edit) ‎[525 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$? words (Computes and stores all acceptable overlaps among all fragment pairs, along with detailed information regarding alignment, during one of the steps. Overlap graph has size at most O(n^2), layout and consensus should not take up more than O(n^2) space) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation...")
• 10:39, 15 February 2023 ‎Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem) (hist | edit) ‎[380 bytes] ‎Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O(V)$ words (https://doi.org/10.1016/S0377-2217(99)00284-2) == Description == Heuristic == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1981 == Reference == https://www.cs.princeton.edu/~bwk/btl.mirror/tsp.pdf")

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)