mirror of
https://github.com/papers-we-love/papers-we-love.git
synced 2026-10-07 19:30:47 +00:00
Fix broken hosted-paper link and typos in topic READMEs (#894)
* Fix broken hosted-paper link and typos in topic READMEs The FRP index links the hosted paper as [Deprecating the Observer Pattern](deprecating-the observer-pattern.pdf). The file on disk really is named with a space, but an unescaped space is not allowed in a CommonMark link destination, so the entry renders as literal text instead of a link. Percent-encode the space so it resolves to the committed PDF. Also correct misspellings in paper titles and descriptions: - Algorithims -> Algorithms (comp_sci_fundamentals_and_history) - simplifed -> simplified (data_structures) - sucessful -> successful, numberator -> numerator, demoninator -> denominator, authoratitative -> authoritative (information_retrieval) - Expresions -> Expressions (logic_and_programming) - represention -> representation (mathematics) - Probablistic -> Probabilistic (robotics, sublinear_algorithms) - Philppe -> Philippe (streaming_algorithms) * Rename the Deprecating the Observer Pattern PDF to drop the space Per review, renaming the file rather than percent-encoding the link.
This commit is contained in:
Toyeshh Medikonda
committed by
GitHub
GitHub
parent
ed4bfd95f0
commit
9b92363eac
@@ -7,7 +7,7 @@
|
||||
* :scroll: [Back to the Future - The Story of Squeak, A Practical Smalltalk Written in Itself](story-of-squeak-a-practical-smalltalk-written-in-itself.pdf) by Dan Ingalls, Ted Kaehler, John Maloney, Scott Wallace & Alan Kay
|
||||
* :scroll: [Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I](recursive-functions-of-symbolic-expressions-and-their-computation-by-machine-parti.pdf) by John McCarthy
|
||||
* :scroll: [An Axiomatic Basis for Computer Programming](axiomatic-basis-computer-programming.pdf) by C. A. R. HOARE
|
||||
* [On the Computational Complexity of Algorithims](http://www.ams.org/journals/tran/1965-117-00/S0002-9947-1965-0170805-7/S0002-9947-1965-0170805-7.pdf) by J. HARTMANIS AND R. E. STEARNS
|
||||
* [On the Computational Complexity of Algorithms](http://www.ams.org/journals/tran/1965-117-00/S0002-9947-1965-0170805-7/S0002-9947-1965-0170805-7.pdf) by J. HARTMANIS AND R. E. STEARNS
|
||||
* :scroll: [Hints for Computer System Design](hints-for-computer-system-design.pdf)
|
||||
* :scroll: [Early Lisp History: 1956-1959](early-lisp-history-1956-1959-herbert-stoyan-html-rendering.pdf) by Herbert Stoyan. This is a pdf rendering of the HTML page available at Archive.org.
|
||||
* :scroll: [Why Programming is a good medium for expressing poorly understood and sloppily-formulated ideas](https://web.archive.org/web/20220426132729/https://web.media.mit.edu/~minsky/papers/Why%20programming%20is--.html) by Marvin Minsky
|
||||
|
||||
@@ -17,4 +17,4 @@
|
||||
|
||||
* :scroll: [The Least Common Ancestor Problem revisited](lca-revisited.pdf)
|
||||
|
||||
* :scroll: [The Level Ancestor Problem simplifed](level-ancestor-simplified.pdf)
|
||||
* :scroll: [The Level Ancestor Problem simplified](level-ancestor-simplified.pdf)
|
||||
|
||||
@@ -27,7 +27,7 @@ The included documents are
|
||||
Engine) in the [Anatomy of a Large-Scale Hypertextual Web Search Engine]
|
||||
http://infolab.stanford.edu/~backrub/google.html which assigned page ranks to
|
||||
every webpage in the world wide web. Google is currently the most commercially
|
||||
sucessful generic search engine in the world.
|
||||
successful generic search engine in the world.
|
||||
|
||||
* [:scroll:](okapi-at-trec3.pdf) [Okapi at TREC3](http://trec.nist.gov/pubs/trec3/papers/city.ps.gz) - Stephen E. Robertson, Steve Walker, Susan Jones, Micheline Hancock-Beaulieu, and Mike Gatford
|
||||
|
||||
@@ -40,7 +40,7 @@ The included documents are
|
||||
of picking a doc randomly and it containing that term :p(q) = n(q) / D,
|
||||
where D is the number of documents. The information content based on
|
||||
shannon's noisy channel model is = -log(p(q)) = log (D / n(q)). Smoothing
|
||||
by adding a constant to both numberator and demoninator leads to IDF term
|
||||
by adding a constant to both numerator and denominator leads to IDF term
|
||||
used in BM25. BM25 has been shown to be one of the best probabilistic
|
||||
weighting schemes. While the paper was in postscript form, the committer has
|
||||
changed the format to pdf as per guidelines of papers we love via ps2pdf.
|
||||
@@ -49,7 +49,7 @@ The included documents are
|
||||
|
||||
This paper introduces the **HITS algorithm**, a link analysis algorithm that rates webpages.
|
||||
Unlike the more famous page rank algorithm, the hits algorithm makes a distinction between
|
||||
webpage behavior classifies them as hubs and authorities. A page is authoratitative
|
||||
webpage behavior classifies them as hubs and authorities. A page is authoritative
|
||||
(in the sense the page has a large number of incoming links) or acts as a hub
|
||||
(a directory of sort, which can be measured by the number of outgoing link).
|
||||
The hits algorithm computes two scores for a page (authority and hub score) where
|
||||
|
||||
@@ -19,7 +19,7 @@
|
||||
|
||||
* :scroll: [A Survey of Functional Reactive Programming](a-survey-of-functional-reactive-programming.pdf)
|
||||
|
||||
* :scroll: [Deprecating the Observer Pattern](deprecating-the observer-pattern.pdf)
|
||||
* :scroll: [Deprecating the Observer Pattern](deprecating-the-observer-pattern.pdf)
|
||||
|
||||
* :scroll: [FrTime: Functional Reactive Programming in PLT Scheme](frp-in-plt-scheme.pdf)
|
||||
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
## Logic and Programming
|
||||
|
||||
* :scroll: [Representing Game Dialogue as Expresions in First-Order Logic](representing-game-dialogue-as-expressions-in-first-order-logic.pdf)
|
||||
* :scroll: [Representing Game Dialogue as Expressions in First-Order Logic](representing-game-dialogue-as-expressions-in-first-order-logic.pdf)
|
||||
* :scroll: [The Event Calculus as a Linear Logic Program](event-calculus.txt)
|
||||
* [Purely Functional Lazy Non-deterministic Programming](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.524)
|
||||
* [:scroll:](on-the-meanings-of-the-logical-constants.pdf) [On the Meanings of the Logical Constants and the Justifications of the Logical Laws](http://uberty.org/wp-content/uploads/2017/06/Martin-Lof83.pdf)
|
||||
|
||||
@@ -14,7 +14,7 @@
|
||||
|
||||
The *graph isomorphism problem* shows how to construct graphs using a simple building-block ("basis"). The same method applies to finding different building blocks to construct the same things. This technique can be applied to file systems, greplin, trees, virtual DOM, etc.
|
||||
|
||||
A short paper, it also shows how to use `𝔰𝔩₂(ℂ)` as a simple mathematical object that leads into the area of real mathematics—represention theory.
|
||||
A short paper, it also shows how to use `𝔰𝔩₂(ℂ)` as a simple mathematical object that leads into the area of real mathematics—representation theory.
|
||||
|
||||
* [Conway's ZIP proof](https://www.maths.ed.ac.uk/~v1ranick/papers/francisweeks.pdf) by George Francis and Jeffrey Weeks
|
||||
|
||||
|
||||
@@ -9,7 +9,7 @@ Robotics
|
||||
|
||||
[Online Trajectory Generation: Basic Concepts for Instantaneous Reactions to Unforeseen Events](http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5350749)
|
||||
|
||||
[Probablistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces](https://www.cs.cmu.edu/~./motionplanning/papers/sbp_papers/PRM/prmbasic_01.pdf)
|
||||
[Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces](https://www.cs.cmu.edu/~./motionplanning/papers/sbp_papers/PRM/prmbasic_01.pdf)
|
||||
|
||||
[Rapidly-Exploring Random Trees: A New Tool for Path Planning](http://msl.cs.uiuc.edu/~lavalle/papers/Lav98c.pdf)
|
||||
|
||||
|
||||
@@ -2,6 +2,6 @@
|
||||
|
||||
[Counting large numbers of events in small registers](http://www.inf.ed.ac.uk/teaching/courses/exc/reading/morris.pdf) by Robert Morris
|
||||
|
||||
[Probabilistic Counting Algorithms for Data Base Applications](https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=b36c153be410c0d937d7583de557c0375506d15a) by Philppe Flajolet, Nigel Martin
|
||||
[Probabilistic Counting Algorithms for Data Base Applications](https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=b36c153be410c0d937d7583de557c0375506d15a) by Philippe Flajolet, Nigel Martin
|
||||
|
||||
[The Space Complexity of Approximating the Frequency Moments](http://www.cs.ucsb.edu/~veronika/MAE/spacecomplexityapproxfreqmoments_alon_99.pdf) by Noga Alon, Yossi Matias, Mario Szegedy
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
|
||||
## Hosted Papers :open_file_folder:
|
||||
|
||||
* :scroll: **[Probablistic Counting Algorithms for Database Applications](https://github.com/papers-we-love/papers-we-love/blob/main/sublinear_algorithms/1985-Flajolet-Probabilistic-counting.pdf)**
|
||||
* :scroll: **[Probabilistic Counting Algorithms for Database Applications](https://github.com/papers-we-love/papers-we-love/blob/main/sublinear_algorithms/1985-Flajolet-Probabilistic-counting.pdf)**
|
||||
|
||||
This paper introduces a class of probabilistic counting algorithms with which one can estimate the number of distinct elements in a large collection of data (typically a large file stored on disk) in a single pass using only a small additional storage (typically less than a hundred binary words) and only a few operations per element scanned. The algorithms are based on statistical observations made on bits of hashed values of records. They are by construction totally insensitive to the replicative structure of elements in the file; they can be used in the context of distributed systems without any degradation of performances and prove especially useful in the context of data bases query optimisation
|
||||
|
||||
|
||||
Reference in New Issue
Block a user