New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 11:24, 3 May 2023 Reduction from Point on 3 Lines to 3 Points on Line (hist | edit) [452 bytes] Admin (talk | contribs) (Created page with "FROM: Point on 3 Lines TO: 3 Points on Line == Description == == Implications == if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$<br/>then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$ == Year == 1995 == Reference == Anka Gajentaan, Mark H Overmars, On a class of O(n2) problems in computational geometry, Computational Geometry, Volume 5, Issue 3, 1995, Pages 165-185 https://doi.org/10.1016/0925-7721(95)00022-2")
- 09:19, 28 April 2023 The SUSAN corner detector (Corner 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 == 1997 == Reference ==")
- 09:19, 28 April 2023 L. Kitchen and A. Rosenfeld (Corner Detection Feature Detection) (hist | edit) [325 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 == 1982 == Reference == https://www.sciencedirect.com/science/article/abs/pii/0167865582900204")
- 09:19, 28 April 2023 Harris and Stephens algorithm (Corner Detection Feature Detection) (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 == 1988 == Reference == http://www.bmva.org/bmvc/1988/avc-88-023.pdf")
- 09:08, 28 April 2023 K-ANNS for a dense 3D map of geometric points (hist | edit) [887 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:k-ANNS for a dense 3D map of geometric points (Nearest Neighbor Search)}} == Description == Within a dataset of $n$ points in a dense 3D geometric map, find approximately the $k$ closest points to a specified point. == Related Problems == Generalizations: k Approximate Nearest Neighbors Search Related: k Nearest Neighbors Search == Parameters == $n$: number of points in dataset $k$: number of neighbors to find == Table of Algorithms ==...")
- 09:00, 10 April 2023 Reduction from Triangle Detection to Disjunctive Reachability Queries in MDPs (hist | edit) [650 bytes] Admin (talk | contribs) (Created page with "FROM: Triangle Detection TO: Disjunctive Reachability Queries in MDPs == Description == == Implications == assume: Strong Triangle<br/>then: there is no combinatorial $O(n^{3-\epsilon})$ or $O((k \cdot n^{2})^{1-\epsilon})$ algorithm for any $\epsilon > {0}$ for target. The bounds holf for dense MDPs with $m=\Theta(n^{2})$ == Year == 2016 == Reference == Chatterjee, Krishnendu, et al. "Model and objective separation with conditional lower bounds: Dis...")
- 08:56, 10 April 2023 Wen (1-dimensional Maximum subarray problem) (hist | edit) [309 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(log n)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM == Year == 1995 == Reference == https://www.sciencedirect.com/science/article/abs/pii/016781919400063G")