New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 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")
- 10:39, 15 February 2023 Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem) (hist | edit) [449 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O({1})$ words (Derived: Nearest neighbor search can be done with constant auxiliary space) == Description == Nearest neighbor search == Approximate? == Approximate Approximation Factor: 1/2\log n + 1/2 == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1974 == Reference == https://link.springer.com/chapter/10.1007/978-1-4020-9688-4_3")
- 10:39, 15 February 2023 Gutina; Gregory; Yeob; Anders; Zverovich; Alexey ( The Traveling-Salesman Problem) (hist | edit) [394 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == - == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference == https://www.researchgate.net/publication/222408030_Traveling_Salesman_Should_not_be_Greedy_Domination_Analysis_of_Greedy-Type_Heuristics_for_the_TSP")
- 10:39, 15 February 2023 Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem) (hist | edit) [343 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^{(p(n)$}) == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.1635&rep=rep1&type=pdf")
- 10:39, 15 February 2023 Applegate et al. (Approximate TSP The Traveling-Salesman Problem) (hist | edit) [296 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2} E)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://www.jstor.org/stable/j.ctt7s8xg")
- 10:39, 15 February 2023 Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance) (hist | edit) [356 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O({1})$ (adding 1 arbitrator, which is of constant size) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1965 == Reference == https://en.wikipedia.org/wiki/Dining_philosophers_problem#Arbitrator_solution")
- 10:39, 15 February 2023 Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance) (hist | edit) [362 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(n)$ (each fork has a mutex and there are O(n) forks) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1965 == Reference == https://en.wikipedia.org/wiki/Dining_philosophers_problem#Resource_hierarchy_solution")
- 10:39, 15 February 2023 HJLS algorithm ( Integer Relation) (hist | edit) [574 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3}(n+k)$) == Space Complexity == $O(n^{2})$ -- but requires infinite precision with large n or else it becomes unstable (Derived: Store Gram-Schmidt basis vectors b_i (n n-dimensional vectors) and Gram-Schmidt numbers \mu_{i,j} (i and j both from 1 to n), not sure how to take into account the "bit complexity" part) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == bit...")
- 10:39, 15 February 2023 Ferreira, Camargo, Song (1D Maximum Subarray Maximum Subarray Problem) (hist | edit) [351 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(log n)$ == Space Complexity == $O(n)$ auxiliary words (constant number of arrays as outlined in algorithm) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM? == Year == 2014 == Reference == https://ieeexplore.ieee.org/document/6972008")
- 10:39, 15 February 2023 Bird (1D Maximum Subarray Maximum Subarray Problem) (hist | edit) [334 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary ??? (keep track of current tail sum and best sum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == ??? == Year == 1989 == Reference == https://dl.acm.org/doi/10.1093/comjnl/32.2.122")
- 10:39, 15 February 2023 Gries (1D Maximum Subarray Maximum Subarray Problem) (hist | edit) [377 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (keep track of current tail sum and best sum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1982 == Reference == https://www.sciencedirect.com/science/article/pii/0167642383900151?via%3Dihub")
- 10:39, 15 February 2023 Fortune ( Delaunay triangulation) (hist | edit) [457 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (See Fortune's Algorithm (Voronoi diagrams); Voronoi diagram gives us O(n) circumcenters which can be used to find the O(n) triangles) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1987 == Reference == http://www.wias-berlin.de/people/si/course/files/Fortune87-SweepLine-Voronoi.pdf")
- 10:39, 15 February 2023 Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods)) (hist | edit) [452 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (Derived: Stores an auxiliary vector) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1929 == Reference == https://onlinelibrary.wiley.com/doi/pdf/10.1002/zamm.19290090105?casa_token=xSwK6PkV010AAAAA:j_1-JKs0GG-KuwUUyM_dIt8kmOa5z6lvp_GABgDryAYxKdYvChyNGA9VA5CZLyAurWOVYPRn45geRTFk")
- 10:39, 15 February 2023 S-buffer/Scanline Rendering ( Shown Surface Determination) (hist | edit) [269 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E+p)$? == Space Complexity == $O(p+n)$? words? ((can be easily derived?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1980 == Reference ==")
- 10:39, 15 February 2023 Z-buffering ( Shown Surface Determination) (hist | edit) [529 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(np)$ == Space Complexity == $O(p+n)$ words? (https://www.geeksforgeeks.org/z-buffer-depth-buffer-method/#:~:text=Z%2Dbuffer%2C%20which%20is%20also,pixels%20times%20number%20of%20objects.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1974 == Reference == http://isgwww.cs.uni-magdeburg.de/graphics/misc/Wolfgang_Stra%C3%9Fer_Schnelle_Kurven-_un...")
- 10:39, 15 February 2023 Binary space partitioning (BSP) ( Shown Surface Determination) (hist | edit) [364 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2}+p)$? (previously said $O(n^{2}logn)$ == Space Complexity == $O(n^{2}+p)$? words? ((can be easily derived?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1969 == Reference == https://apps.dtic.mil/dtic/tr/fulltext/u2/700375.pdf")
- 10:39, 15 February 2023 Ray tracing ( Shown Surface Determination) (hist | edit) [267 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(np)$ == Space Complexity == $O(p+n)$? words? ((can be easily derived?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1982 == Reference ==")