Search results
Jump to navigation
Jump to search
Page title matches
- #REDIRECT [[Online algorithm]] ...30 bytes (3 words) - 21:12, 1 March 2006
Page text matches
- * [[Analysis of algorithms]] * [[Competitive analysis (online algorithm)|Competitive analysis]] ...1 KB (141 words) - 13:50, 14 September 2024
- {{distinguish|online and offline}} In [[computer science]], an '''online algorithm'''<ref name="karp92" /> is one that can process its input piece-b ...6 KB (823 words) - 13:17, 23 June 2025
- ...title=ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms |eprint=1807.05614 |class=cs.IR |date=2018-07-15}}</ref> ...901 bytes (116 words) - 13:56, 7 June 2025
- ...model]], in online algorithms, used to show competitiveness of randomized algorithms ...1 KB (183 words) - 06:46, 6 June 2024
- ...the [[Association for Computing Machinery]] [[Special Interest Group]] on Algorithms and Computation Theory, whose purpose is support of research in [[theoretic ...print newsletter, '''''SIGACT News'''''. Its online version, ''SIGACT News Online'', is available since 1996 for SIGACT members, with unrestricted access to ...4 KB (557 words) - 13:15, 25 November 2023
- Important algorithms in computational group theory include: ...eared in the [[Notices of the American Mathematical Society]] is available online. There is also a [http://www.math.rutgers.edu/~sims/publications/survey.pdf ...3 KB (370 words) - 18:19, 23 September 2023
- ...ional learning theory]], a mathematical theory to analyze machine learning algorithms. * [[Online machine learning]], the process of teaching a machine. ...1 KB (113 words) - 12:15, 13 January 2022
- ...=t7RDjagG1FAC&pg=PA498 |language=en}}</ref> More general phonetic matching algorithms take articulatory features into account <ref>Ladefoged, Peter. [https://acl ==Algorithms== ...6 KB (800 words) - 14:59, 4 March 2025
- ....1/dbadmin/natlang-s-7003956.html |access-date=2023-08-16 |website=SyBooks Online}}</ref> ICU supports tailoring, and the collation tailorings from CLDR are ...u4c-demos.unicode.org/icu-bin/locexp?_=en_US&x=col ICU Locale Explorer] An online demonstration of the Unicode Collation Algorithm using [[International Comp ...3 KB (466 words) - 00:30, 1 May 2025
- ...may or may not count the output as part of its space usage. Since in-place algorithms usually overwrite their input with output, no additional space is needed. W ...ection sort]], [[insertion sort]], [[heapsort]], and [[Shell sort]]. These algorithms require only a few pointers, so their space complexity is {{math|''O''(log ...8 KB (1,245 words) - 06:39, 30 June 2025
- Shoup's main research interests and contributions are computer [[algorithms]] relating to [[number theory]], [[algebra]], and [[cryptography]]. His co ...GNU]] [[GNU General Public License|GPL]]) [[C++]] library of number theory algorithms, NTL, is widely used and well regarded for its high performance. ...4 KB (538 words) - 00:46, 18 March 2025
- ...rom {{citation|last1=Bentley|first1=J. L.|last2=Ottmann|first2=T. A.|title=Algorithms for reporting and counting geometric intersections|journal=IEEE Transaction |thesis_title = Divide and conquer algorithms for closest point problems in multidimensional space ...6 KB (851 words) - 06:57, 21 March 2025
- ==Algorithms and implementations== ...=https://www.nytimes.com/2012/02/15/technology/researchers-find-flaw-in-an-online-encryption-method.html ...4 KB (559 words) - 05:32, 2 July 2025
- ...343 | page=}}</ref> Its typical use is sorting elements [[online algorithm|online]]: after each insertion, the set of elements seen so far is available in so ...quire separate memory to be allocated for the tree, as opposed to in-place algorithms such as [[quicksort]] or [[heapsort]]. On most common platforms, this means ...5 KB (783 words) - 04:27, 5 April 2025
- ...ience] (US1 Princeton)</ref> He also replaced live lectures with on-demand online videos.<ref>[https://www.cs.princeton.edu/news/%E2%80%98computer-science-al .../ref> [[heapsort]] (with R. Schaffer),<ref>The Analysis of Heapsort. J. of Algorithms, 1993.</ref> and [[Batcher's sort]].<ref>Data Movement in Odd-Even Merging. ...17 KB (2,185 words) - 21:35, 7 January 2025
- ==Algorithms== ...for the best resource(s) according to their balance of "money", as in an [[online auction business model]] (see also [[auction theory]]). ...4 KB (599 words) - 16:34, 1 June 2025
- ...ls.com/marketing-glossary/search-operators/|access-date=2020-09-17|website=Online Marketing Glossary}}</ref> ...ls.com/marketing-glossary/search-operators/|access-date=2020-09-17|website=Online Marketing Glossary}}</ref> For example, a search for <code>red apple</code> ...3 KB (424 words) - 12:08, 6 June 2023
- ...l,d)-Motif Problem with Negative Set]", Proceedings of the 5th Workshop on Algorithms in Bioinformatics (WABI 2005), (October 2005) (accepted) ...and Henry C.M. Leung, "[http://www.cs.hku.hk/~chin/paper/apbc05.pdf Voting Algorithms for Discovering Long Motifs]", Proceedings of the Third Asia-Pacific Bioinf ...6 KB (829 words) - 23:19, 1 May 2024
- [https://books.google.com/books?id=2aCoW8m40AwC "Algorithms - ESA '94"]. ...e First-Served Hashing"], in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 September 2015. ...9 KB (1,285 words) - 10:26, 16 June 2025
- {{short description|Algorithms for processing data too large to fit into a computer's main memory at once} ...4|isbn=978-1-60198-106-6|citeseerx=10.1.1.140.3731}}</ref> External memory algorithms are analyzed in the '''external memory model'''. ...9 KB (1,320 words) - 21:20, 19 January 2025