User contributions for Admin
Jump to navigation
Jump to search
10 April 2023
- 08:4908:49, 10 April 2023 diff hist −6 The INDEGREE Algorithm (InDegree Analysis Link Analysis) No edit summary current
- 08:4908:49, 10 April 2023 diff hist −10 Naive (All Maximal Non-Branching Paths in a Graph All Maximal Non-Branching Paths in a Graph) No edit summary current
- 08:4908:49, 10 April 2023 diff hist +418 N Kingsford (Motif Search Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m^{2}n^{2})$ words (Creates an ILP with $O(m^2n^2)$ variables and $O(n^2m)$ constraints, each involving $O(m)$ variables) == Description == ILP formulation == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://link.springer.com/chapter/10.1007/11780441_22" current
- 08:4908:49, 10 April 2023 diff hist +364 N Liang Cwinnower (Motif Search Motif Search) Created page with "== Time Complexity == $O(nm^{0.5})$ == Space Complexity == $O(m^{2})$ words (Considers a graph on $O(m)$ nodes and $O(m^2)$ edges) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://www.worldscientific.com/doi/10.1142/S0219720004000466" current
- 08:4908:49, 10 April 2023 diff hist +370 N Sagot M (Motif Search Motif Search) Created page with "== Time Complexity == $O(n \log(n)$ m^{1.{4}5}) == Space Complexity == $O(mn^{2}/w)$ words (https://link.springer.com/chapter/10.1007/BFb0054337) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1988 == Reference == https://link.springer.com/chapter/10.1007/BFb0054337" current
- 08:4908:49, 10 April 2023 diff hist +407 N Bailey TL; Elkan C MEME (Motif Search Motif Search) Created page with "== Time Complexity == $O(n^{2}m^{2})$ == Space Complexity == $O(mn)$ words (Uses iterations of the EM algorithm as in (Lawrence, Reilly 1990), and thus uses similar amounts of space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1995 == Reference == https://link.springer.com/article/10.1007/BF00993379" current
- 08:4908:49, 10 April 2023 diff hist +367 N Sinha S; Tompa M YMF (Yeast Motif Finder) (Motif Search Motif Search) Created page with "== Time Complexity == $O(n^{0.{6}6} m)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/10977095" current
- 08:4908:49, 10 April 2023 diff hist +410 N Tompa M (Motif Search Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m^{2})$ words (Requires considering an $O(m^2)*O(m^2)$ matrix with $O(m^2)$ nonzero entries, based on a DFA with $O(m^2)$ states) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://www.aaai.org/Papers/ISMB/1999/ISMB99-030.pdf" current
- 08:4908:49, 10 April 2023 diff hist +378 N Van Helden J; Rios AF; Collado-Vides J (Motif Search Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == Dyad analysis == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.ncbi.nlm.nih.gov/pmc/articles/PMC102821/" current
- 08:4908:49, 10 April 2023 diff hist +431 N Helden Oligo-Analysis (Motif Search Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == Uses oligonucleotides? Also only detects "short" motifs, and used for yeast == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/9719638" current
- 08:4908:49, 10 April 2023 diff hist +1 Dinur & Steurer ( The Set-Covering Problem) No edit summary current
- 08:4908:49, 10 April 2023 diff hist +1 Raz & Safra ( The Set-Covering Problem) No edit summary current
- 08:4908:49, 10 April 2023 diff hist +1 Greedy Algorithm ( The Set-Covering Problem) No edit summary current
- 08:4908:49, 10 April 2023 diff hist +4 Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) No edit summary current
- 08:4908:49, 10 April 2023 diff hist +1 Maybeck; Peter S Extended Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) No edit summary current
- 08:4908:49, 10 April 2023 diff hist 0 Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) No edit summary current Tag: Manual revert
- 08:4908:49, 10 April 2023 diff hist 0 Stratonovich (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) No edit summary Tags: Manual revert Reverted
- 08:4808:48, 10 April 2023 diff hist +1 Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +1 Shaban; Amirreza; Mehrdad; Farajtabar (Maximum Likelihood Methods in Unknown Latent Variables; multi-view model, discrete observations Maximum Likelihood Methods in Unknown Latent Variables) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +1 EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +1 SPRINGBORN B.; SCHROEDER P.; PINKALL U. 2008 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +1 BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +4 YANG Y.; KIM J.; LUO F.; HU S.; GU X. 2008 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +3 ZAYER R.; ROESSL C.; SEIDEL H.-P 2005 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +1 LÉVY B.; PETITJEAN S.; RAY N.; MAILLOT J 2002 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +1 LEE Y.; KIM H. S.; LEE S 2002 (Mesh Parameterization Mesh Parameterization) No edit summary current
- 08:4808:48, 10 April 2023 diff hist +441 N B. I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == $O(n)$?? words (Requires computing the coefficients b_i and functions Phi(x) and Psi(x) as in equations 17 and 18) == Description == Discrete Generalized Splines == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == http://sutir.sut.ac.th:8080/sutir/bitstream/123456789/431/1/bib115.pdf" current
- 08:4808:48, 10 April 2023 diff hist +411 N P. Costantini, B. I. Kvasov, and C. Manni (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{5} \log K)$ == Space Complexity == $O(n)$? words (Derived: Pentadiagonal matrix in the linear system only requires O(n) space) == Description == Pentadiagonal linear system == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://link.springer.com/article/10.1023/A:1018988312596" current
- 08:4808:48, 10 April 2023 diff hist +229 N V. I. Paasonen (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{5} \log K)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1968 == Reference ==" current
- 08:4808:48, 10 April 2023 diff hist +316 N V. A. Lyul’ka and I. E. Mikhailov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference == http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=zvmmf&paperid=943&option_lang=eng" current
- 08:4808:48, 10 April 2023 diff hist +261 N V. A. Lyul’ka and A. V. Romanenko (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{5})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference == https://www.mathnet.ru/eng/zvmmf2544" current
- 08:4808:48, 10 April 2023 diff hist +413 N B.I. Kvasov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) Created page with "== Time Complexity == $O(n^{3} \log^{2}K)$ == Space Complexity == $O(n)$? words (Derived: Tridiagonal matrices in the linear system only require O(n) space) == Description == Tridiagonal linear system == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2008 == Reference == https://link.springer.com/article/10.1134/S0965542508040039" current
- 08:4608:46, 10 April 2023 diff hist +138 Martinian and M. J. Wainwright (Lossy Compression Data Compression) No edit summary current
- 08:4608:46, 10 April 2023 diff hist +127 Miyake 2006 (Lossy Compression Data Compression) No edit summary current
- 08:4608:46, 10 April 2023 diff hist +142 Sun; M. Shao; J. Chen; K. Wong; and X. Wu (Lossy Compression Data Compression) No edit summary current
- 08:4608:46, 10 April 2023 diff hist +64 Brute force (Lossy Compression Data Compression) No edit summary current
- 08:4608:46, 10 April 2023 diff hist +135 Ciliberti; Mézard (Lossy Compression Data Compression) No edit summary current
- 08:4608:46, 10 April 2023 diff hist +8 Maneva and M. J. Wainwright (Lossy Compression Data Compression) No edit summary current
- 08:4608:46, 10 April 2023 diff hist −3 GLR parser (CFG Parsing CFG Problems) No edit summary current
- 08:4608:46, 10 April 2023 diff hist −365 Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem) No edit summary Tags: Manual revert Reverted
- 08:4608:46, 10 April 2023 diff hist +365 Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem) No edit summary Tags: Manual revert Reverted
- 08:4608:46, 10 April 2023 diff hist −10 Sam Buss (The Vertex Cover Problem The Vertex Cover Problem) No edit summary current
- 08:4608:46, 10 April 2023 diff hist −10 Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem) No edit summary current
- 08:4608:46, 10 April 2023 diff hist −9 C-LOOK (Disk Scheduling Disk Scheduling) No edit summary current
- 08:4408:44, 10 April 2023 diff hist −9 C-SCAN (Disk Scheduling Disk Scheduling) No edit summary current
- 08:4408:44, 10 April 2023 diff hist −9 LOOK (Disk Scheduling Disk Scheduling) No edit summary current
- 08:4408:44, 10 April 2023 diff hist −9 SCAN (Disk Scheduling Disk Scheduling) No edit summary current
- 08:4408:44, 10 April 2023 diff hist −9 SSTF (Disk Scheduling Disk Scheduling) No edit summary current
- 08:4408:44, 10 April 2023 diff hist −10 FCFS (Disk Scheduling Disk Scheduling) No edit summary current
- 08:4408:44, 10 April 2023 diff hist +1 Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem) No edit summary current