mirror of
https://github.com/papers-we-love/papers-we-love.git
synced 2024-10-27 20:34:20 +00:00
Vipul Vaibhaw
GitHub
commit
67be3dcd59
2
.github/CONTRIBUTING.md
vendored
2
.github/CONTRIBUTING.md
vendored
@ -11,7 +11,7 @@ We want to help bring academic research closer to practitioners and we strive to
|
||||
|
||||
### Respect content licenses
|
||||
|
||||
* **We will only merge pull requests that contain research papers that allow digital distribution.** Papers whose copyright prohibits redistribution will not be accepted; for example [license 1](http://www.acm.org/publications/policies/copyright-policy-v1) from the [ACM digital library](http://www.acm.org/publications/policies/copyright_policy).
|
||||
* **We will only merge pull requests that contain research papers that allow digital distribution.** Papers whose copyright prohibits redistribution will not be accepted; for example [license 1](http://www.acm.org/publications/policies/copyright-policy-v1/) from the [ACM digital library](http://www.acm.org/publications/policies/copyright_policy).
|
||||
* We encourage papers that do not allow digital distribution to be added to a README, with a link to the source URL, in the appropriate subject's folder. For example, [the distributed systems README](https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/README.md).
|
||||
|
||||
### Follow our commit, naming, and directory-organization conventions
|
||||
|
||||
@ -16,7 +16,8 @@ Need help?
|
||||
If you are experiencing harassment on or have concerns about content within the [GitHub repo](https://github.com/papers-we-love/papers-we-love), the **#paperswelove** IRC channel on Freenode, the **paperswelove.slack.com** Slack, [PapersWeLove.org](http://paperswelove.org), or via remote presentations, please contact:
|
||||
|
||||
- **Zeeshan Lakhani** [zeeshan@paperswelove.org](mailto:zeeshan@paperswelove.org)
|
||||
- **Clint Newsom** [clint@paperswelove.org](mailto:clint@paperswelove.org)
|
||||
- **Ines Sombra** [ines@paperswelove.org](mailto:ines@paperswelove.org)
|
||||
- **Elaine Greenberg** [elaine@paperswelove.org](mailto:elaine@paperswelove.org)
|
||||
- **Jeremy Heiler** (Github) [jeremy@paperswelove.org](mailto:jeremy@paperswelove.org)
|
||||
- **Darren Newton** (paperswelove.org) [darren@paperswelove.org](mailto:darren@paperswelove.org)
|
||||
- **All** [contact@paperswelove.org](mailto:contact@paperswelove.org)
|
||||
|
||||
10
README.md
10
README.md
@ -1,4 +1,4 @@
|
||||
## 
|
||||
## 
|
||||
|
||||
**Papers We Love** (*PWL*) is a community built around reading, discussing and learning more about academic computer science papers. This repository serves as a directory of some of the best papers the community can find, bringing together documents scattered across the web. You can also visit the [Papers We Love site](http://paperswelove.org/) for more info.
|
||||
|
||||
@ -18,6 +18,7 @@ Here are our official chapters. Let us know if you are interested in [starting o
|
||||
* [Boulder](http://www.meetup.com/Papers-We-Love-Boulder/)
|
||||
* [Bucharest](http://www.meetup.com/papers-we-love-bucharest/)
|
||||
* [Chattanooga](http://www.meetup.com/Papers-We-Love-Chattanooga/)
|
||||
* [Chicago](http://www.meetup.com/papers-we-love-chicago/)
|
||||
* [Columbus, Ohio](http://www.meetup.com/Papers-We-Love-Columbus/)
|
||||
* [Dallas](http://www.papersdallas.com/)
|
||||
* [Gothenburg](https://www.meetup.com/Papers-We-Love-Gothenburg/)
|
||||
@ -25,9 +26,11 @@ Here are our official chapters. Let us know if you are interested in [starting o
|
||||
* [Hyderabad](http://www.meetup.com/papers-we-love-hyderabad/)
|
||||
* [Iasi](http://www.meetup.com/Papers-We-Love-Iasi/)
|
||||
* [Kathmandu](https://www.facebook.com/groups/PapersWeLoveKathmandu/)
|
||||
* [Lebanon](http://www.paperswelovelb.club)
|
||||
* [London](http://www.meetup.com/papers-we-love-london)
|
||||
* [Los Angeles](http://www.meetup.com/papers-we-love-la)
|
||||
* [Madrid](http://www.meetup.com/Papers-We-Love-Madrid/)
|
||||
* [Medellín](https://www.meetup.com/paperswelovemde/)
|
||||
* [Montreal](http://www.meetup.com/Papers-We-Love-Montreal/)
|
||||
* [Munich](http://www.meetup.com/Papers-We-Love-Munich/)
|
||||
* [New York City](http://www.meetup.com/papers-we-love/)
|
||||
@ -35,6 +38,7 @@ Here are our official chapters. Let us know if you are interested in [starting o
|
||||
* [Philadelphia](http://www.meetup.com/Papers-We-Love-Philadelphia/)
|
||||
* [Portland](http://www.meetup.com/Papers-We-Love-PDX/)
|
||||
* [Pune](http://www.meetup.com/Doo-Things)
|
||||
* [Raleigh-Durham](https://www.meetup.com/Papers-We-Love-Raleigh-Durham/)
|
||||
* [Reykjavík](http://www.meetup.com/Papers-We-Love-Reykjavik)
|
||||
* [San Diego](http://www.meetup.com/Papers-We-Love-San-Diego/)
|
||||
* [San Francisco](http://www.meetup.com/papers-we-love-too/)
|
||||
@ -42,10 +46,12 @@ Here are our official chapters. Let us know if you are interested in [starting o
|
||||
* [Seoul, Korea](http://www.meetup.com/seoul-tech-society)
|
||||
* [Singapore](https://www.facebook.com/groups/paperswelovesg/)
|
||||
* [St. Louis](http://www.meetup.com/Papers-We-Love-in-saint-louis/)
|
||||
* [Teresina](https://www.meetup.com/pt-BR/Papers-We-Love-Teresina/)
|
||||
* [Toronto](http://www.meetup.com/Papers-We-Love-Toronto/)
|
||||
* [Vienna](http://www.meetup.com/Papers-We-Love-Vienna/)
|
||||
* [Washington, DC](http://www.meetup.com/Papers-We-Love-DC-NoVA/)
|
||||
* [Winnipeg](http://www.meetup.com/Papers-We-Love-Winnipeg/)
|
||||
* [Winnipeg](http://pwlwpg.ca/)
|
||||
* [Zürich](https://www.meetup.com/Papers-we-love-Zurich/)
|
||||
|
||||
All of our meetups follow our [Code of Conduct](CODE_OF_CONDUCT.md).
|
||||
|
||||
|
||||
@ -3,3 +3,5 @@
|
||||
* [:scroll:](a-constant-algorithm-for-implementing-the-lfu-cache-eviction-scheme.pdf) [An O(1) algorithm for implementing the LFU cache eviction scheme](https://github.com/papers-we-love/papers-we-love/blob/master/caching/a-constant-algorithm-for-implementing-the-lfu-cache-eviction-scheme.pdf) by Prof. Ketan Shah, Anirban Mitra, Dhruv Matani
|
||||
|
||||
* [:scroll:](2q-a-low-overhead-high-performance-buffer-management-replacement-algorithm.pdf) [2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm](http://www.vldb.org/conf/1994/P439.PDF) by Theodore Johnson and Dennis Shasha
|
||||
|
||||
* [:scroll:](a-program-optimization-for-automatic-database-result-caching.pdf)[A Program Optimization for Automatic Database Result Caching](http://adam.chlipala.net/papers/SqlcachePOPL17/SqlcachePOPL17.pdf) by Ziv Scully and Adam Chlipala
|
||||
|
||||
Binary file not shown.
@ -1,11 +1,12 @@
|
||||
## Computer Science Fundamentals and History
|
||||
|
||||
* "Turing, On computable numbers, with an application to the Entscheidungsproblem" by Alan Turing
|
||||
* As a PDF: [Turing, On computable numbers, with an application to the Entscheidungsproblem](https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf)
|
||||
* As a PDF: [Turing, On computable numbers, with an application to the Entscheidungsproblem](https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf)
|
||||
* As a collection of single images: [Turing, On computable numbers, with an application to the Entscheidungsproblem](http://www.turingarchive.org/browse.php/B/12) by Alan Turing
|
||||
* [Mealy, A Method for Synthesizing Sequential Circuits] (http://www3.alcatel-lucent.com/bstj/vol34-1955/articles/bstj34-5-1045.pdf) by George H. Mealy
|
||||
* :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
|
||||
* :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
|
||||
* :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.
|
||||
|
||||
Binary file not shown.
@ -21,6 +21,9 @@ This is a really great paper that is both complex and straightforward. This pape
|
||||
### Object modeling
|
||||
* [3-Sweep: Extracting Editable Objects from a Single Photo](http://www.cs.tau.ac.il/~dcor/articles/2013/3-Sweep-Extracting-Editable-Objects.pdf) - [Video](https://www.youtube.com/watch?v=Oie1ZXWceqM)
|
||||
|
||||
### Photo editing
|
||||
* [Deep Photo Style Transfer](https://arxiv.org/pdf/1703.07511.pdf) (2017) - [Code](https://github.com/luanfujun/deep-photo-styletransfer) - A deep-learning approach to photographic style transfer (that is, taking the style of one photo and automatically applying it to another). The images in this paper are gorgeous.
|
||||
|
||||
### Lighting
|
||||
* [Light Propagation Volumes in CryEngine 3](http://www.crytek.com/download/Light_Propagation_Volumes.pdf)
|
||||
|
||||
@ -42,8 +45,8 @@ This is a really great paper that is both complex and straightforward. This pape
|
||||
> Of all the ways to manipulate a 3D mesh, push/ technique popularized by SketchUp is one of the most approachable and fun. PushPull++ is a recent paper that elaborates on the technique, cleaning up a lot of edge cases and unlocking new features, using wonderfully straightforward math. The potential for 3D modeling tools or procedural mesh generation APIs built on these simple ideas is very exciting.
|
||||
> The paper presents the technique and the tool that the authors built. I will focus on the technique, as s the part I loved more in this paper (quote by Ramsey Nasser).
|
||||
|
||||
|
||||
|
||||
### Image Processing
|
||||
* :scroll: [Imaging Vector Fields Using Line Integral Convolution](http://cs.brown.edu/courses/csci2370/2000/1999/cabral.pdf) by Brian Cabral and Leith Leedom
|
||||
|
||||
### Shape grammars
|
||||
|
||||
|
||||
File diff suppressed because one or more lines are too long
@ -1,4 +1,8 @@
|
||||
# Data Replication
|
||||
|
||||
* :scroll: [A comprehensive study of
Convergent and Commutative Replicated Data Types](a-comprehensive-study-of-convergent-and-communative-replicated-data-types.pdf)
|
||||
* :scroll: [Immutability Changes Everything](http://cidrdb.org/cidr2015/Papers/CIDR15_Paper16.pdf)
|
||||
> An overview on the patterns in computing leveraging immutability.
|
||||
Nowadays, keeping immutable copies of data is almost inexpensive. One of the advantages of this fact is that it
|
||||
can alleviate the burden of coordinated accesses to the data in the different layers of the SW/HW stack.
|
||||
* :scroll: [A comprehensive study of Convergent and Commutative Replicated Data Types](a-comprehensive-study-of-convergent-and-communative-replicated-data-types.pdf)
|
||||
> Eventual consistency aims to ensure that replicas of some mutable shared object converge without foreground synchronisation. We study a principled approach: to base the design of shared data types on some simple formal conditions that are sufficient to guarantee even- tual consistency. We call these types Convergent or Commutative Replicated Data Types (CRDTs).
|
||||
@ -42,7 +42,6 @@
|
||||
|
||||
* [Towards a Next Generation Data Center Architecture: Scalability and Commoditization](http://research.microsoft.com/pubs/79348/presto27-greenberg.pdf)
|
||||
|
||||
|
||||
## Hosted Papers
|
||||
|
||||
* :scroll: [Bigtable: A Distributed Storage System for Structured Data](bigtable-a-distributed-storage-system-for-structured-data.pdf)
|
||||
@ -71,3 +70,4 @@
|
||||
|
||||
* :scroll: [Warp: Multi-Key Transactions for Key-Value Stores](warp-multi-key-transactions-for-key-value-stores.pdf)
|
||||
|
||||
* :scroll: [Spartan: A distributed array framework with smart tiling](spartan-a-distributed-array-framework-with-smart-tiling.pdf)
|
||||
|
||||
Binary file not shown.
@ -31,7 +31,7 @@
|
||||
|
||||
* [Omega: flexible, scalable schedulers for large compute clusters](http://research.google.com/pubs/archive/41684.pdf)
|
||||
|
||||
* [Orleans: Distributed Virtual Actors for Programmability and Scalability] (http://research.microsoft.com/apps/pubs/default.aspx?id=210931)
|
||||
* [Orleans: Distributed Virtual Actors for Programmability and Scalability](http://research.microsoft.com/apps/pubs/default.aspx?id=210931)
|
||||
|
||||
* [Paxos Made Live - An Engineering Perspective](http://www.cs.utexas.edu/users/lorenzo/corsi/cs380d/papers/paper2-1.pdf)
|
||||
|
||||
@ -253,6 +253,8 @@ Full Cluster Geo-replication](tiered-replication-a-cost-effective-alternative-to
|
||||
|
||||
* :scroll: [Warp: Multi-Key Transactions for Key-Value Stores](../datastores/warp-multi-key-transactions-for-key-value-stores.pdf)
|
||||
|
||||
* :scroll: [Spartan: A distributed array framework with smart tiling](../datastores/spartan-a-distributed-array-framework-with-smart-tiling.pdf)
|
||||
|
||||
### Physics
|
||||
|
||||
* :scroll: [“On the Electrodynamics of Moving Bodies” (1905) — Einstein](../physics/on-the-electrodynamics-of-moving-bodies.pdf)
|
||||
|
||||
@ -1,4 +1,5 @@
|
||||
* [A Unified Theory of Garbage Collection](http://www.cs.virginia.edu/~cs415/reading/bacon-garbage.pdf)
|
||||
> An overview for programmers and language implementors for understanding different garbage collection algorithms.
|
||||
* [A LISP Garbage-Collector for Virtual-Memory Computer Systems](https://www.cs.purdue.edu/homes/hosking/690M/p611-fenichel.pdf)
|
||||
|
||||
* [Incremental Collection of Mature Objects](http://pdf.aminer.org/000/465/194/incremental_collection_of_mature_objects.pdf)
|
||||
|
||||
@ -1,7 +1,7 @@
|
||||
## Gossip
|
||||
|
||||
If you only read one of these papers, start with the classic Demers, et al paper:
|
||||
* [Epidemic Algorithms for Replicated Database Maintenance] (http://bitsavers.informatik.uni-stuttgart.de/pdf/xerox/parc/techReports/CSL-89-1_Epidemic_Algorithms_for_Replicated_Database_Maintenance.pdf)
|
||||
* [Epidemic Algorithms for Replicated Database Maintenance](http://bitsavers.informatik.uni-stuttgart.de/pdf/xerox/parc/techReports/CSL-89-1_Epidemic_Algorithms_for_Replicated_Database_Maintenance.pdf)
|
||||
|
||||
# Peer sampling services
|
||||
Briefly, a peer sampling service is a system that maintains a restricted set (partial view) of the all machines participating in a gossip system.
|
||||
@ -16,6 +16,6 @@ Briefly, a peer sampling service is a system that maintains a restricted set (pa
|
||||
* [Epidemic Broadcast Trees](http://www.gsd.inesc-id.pt/~ler/reports/srds07.pdf)
|
||||
|
||||
# Failure Detectors
|
||||
* [A Gossip-Style Failure Detection Service](http://ecommons.cornell.edu/bitstream/1813/7341/2/98-1687.ps)
|
||||
* [A Gossip-Style Failure Detection Service](https://ecommons.cornell.edu/bitstream/handle/1813/7341/98-1687.pdf)
|
||||
* [The ϕ Accrual Failure Detector ](http://ddg.jaist.ac.jp/pub/HDY+04.pdf)
|
||||
|
||||
|
||||
@ -47,5 +47,5 @@ The included documents are
|
||||
|
||||
* [:scroll:](hits.pdf) [Hits Algorithm](https://www.cs.cornell.edu/home/kleinber/auth.pdf) - Jon M. Kleinberg
|
||||
|
||||
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 autho rities. A page is authoratitative (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 the algorithm iteratively computes the hub score as sum of authority scores of outgoing links and authority scores as sum of hub scores of incoming links until a convergence is attained. These scores can then be used to rank documents. While this algorithm is famous in academia, its not very widely used in the industry (a variant of this algorithm was used by a company called Teoma which was acquired by AskJeeves)
|
||||
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 (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 the algorithm iteratively computes the hub score as sum of authority scores of outgoing links and authority scores as sum of hub scores of incoming links until a convergence is attained. These scores can then be used to rank documents. While this algorithm is famous in academia, its not very widely used in the industry (a variant of this algorithm was used by a company called Teoma which was acquired by AskJeeves)
|
||||
|
||||
|
||||
6
languages/erlang/README.md
Normal file
6
languages/erlang/README.md
Normal file
@ -0,0 +1,6 @@
|
||||
# Erlang
|
||||
|
||||
* [Making reliable distributed systems in the presence of software errors](http://erlang.org/download/armstrong_thesis_2003.pdf)
|
||||
PhD thesis of Joe Armstrong, Erlang’s co-inventor, describing the origins of Erlang.
|
||||
|
||||
* [A History of Erlang](http://webcem01.cem.itesm.mx:8005/erlang/cd/downloads/hopl_erlang.pdf) by Joe Armstrong
|
||||
@ -15,6 +15,8 @@
|
||||
|
||||
* [Applications of Machine Learning to Location Data](http://www.berkkapicioglu.com/wp-content/uploads/2013/11/thesis_final.pdf) - Using machine learning to design and analyze novel algorithms that leverage location data.
|
||||
|
||||
* ["Why Should I Trust You?" Explaining the Predictions of Any Classifier](http://www.kdd.org/kdd2016/papers/files/rfp0573-ribeiroA.pdf) - This paper introduces an explanation technique for any classifier in a interpretable manner.
|
||||
|
||||
## Hosted Papers
|
||||
|
||||
* :scroll: **[A Sparse Johnson-Lindenstrauss Transform](dimensionality_reduction/a-sparse-johnson-lindenstrauss-transform.pdf)**
|
||||
|
||||
@ -1,13 +1,27 @@
|
||||
## Operating Systems
|
||||
|
||||
* [Xen and the Art of Virtualization](http://www.cl.cam.ac.uk/research/srg/netos/papers/2003-xensosp.pdf)
|
||||
* :scroll: [The UNIX Time-Sharing System](unix-time-sharing-system.pdf)
|
||||
|
||||
* [The operating system: should there be one?](http://plosworkshop.org/2013/preprint/kell.pdf)
|
||||
|
||||
* [The Scalable Commutativity Rule: Designing Scalable Software for Multicore Processors](https://people.csail.mit.edu/nickolai/papers/clements-sc.pdf)
|
||||
|
||||
## System Virtualization
|
||||
|
||||
* [Xen and the Art of Virtualization](http://www.cl.cam.ac.uk/research/srg/netos/papers/2003-xensosp.pdf)
|
||||
|
||||
* :scroll: [kvm: the Linux Virtual Machine Monitor](kvm-linux-virtual-machines-monitor.pdf)
|
||||
|
||||
### Live migration of Virtual Machines
|
||||
|
||||
* :scroll: [Live Migration of Virtual Machines](live-migration-of-virtual-machines.pdf)
|
||||
|
||||
## Jails and containers
|
||||
|
||||
* :scroll: [Jails: Confining the omnipotent root.](https://us-east.manta.joyent.com/bcantrill/public/ppwl-cantrill-jails.pdf)
|
||||
|
||||
* :scroll: [Solaris Zones: Operating System Support for Consolidating Commercial Workloads](https://us-east.manta.joyent.com/bcantrill/public/ppwl-cantrill-zones.pdf)
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
BIN
operating_systems/kvm-linux-virtual-machines-monitor.pdf
Normal file
BIN
operating_systems/kvm-linux-virtual-machines-monitor.pdf
Normal file
Binary file not shown.
BIN
operating_systems/unix-time-sharing-system.pdf
Normal file
BIN
operating_systems/unix-time-sharing-system.pdf
Normal file
Binary file not shown.
@ -2,4 +2,8 @@
|
||||
|
||||
## Included Papers
|
||||
|
||||
* [:scroll:](advance_in_quantum_machine_learning.pdf) [Advances in quantum machine learning (2015)](https://arxiv.org/abs/1512.02900) (Jeremy Adcock, Euan Allen, Matthew Day, Stefan Frick, Janna Hinchliff, Mack Johnson, Sam Morley-Short, Sam Pallister, Alasdair Price, Stasja Stanisic)
|
||||
* [:scroll:](advance_in_quantum_machine_learning.pdf) [Advances in quantum machine learning (2015)](https://arxiv.org/abs/1512.02900) (Jeremy Adcock, Euan Allen, Matthew Day, Stefan Frick, Janna Hinchliff, Mack Johnson, Sam Morley-Short, Sam Pallister, Alasdair Price, Stasja Stanisic)
|
||||
|
||||
* [:scroll:](shors_algorithm.pdf) [Shors algorithm for polynomial time prime factorization (1995)](https://arxiv.org/pdf/quant-ph/9508027.pdf) (Peter W Shor)
|
||||
|
||||
* [:scroll:](grovers_algorithm.pdf) [A fast quantum mechanical algorithm for database search](https://arxiv.org/pdf/quant-ph/9605043.pdf) (Lov K. Grover)
|
||||
|
||||
BIN
quantum_computing/grovers_algorithm.pdf
Normal file
BIN
quantum_computing/grovers_algorithm.pdf
Normal file
Binary file not shown.
BIN
quantum_computing/shors_algorithm.pdf
Normal file
BIN
quantum_computing/shors_algorithm.pdf
Normal file
Binary file not shown.
@ -1,7 +1,7 @@
|
||||
## Security
|
||||
|
||||
* [Reflections on Trusting Trust (1984)](http://www.ece.cmu.edu/~ganger/712.fall02/papers/p761-thompson.pdf)
|
||||
* [Internet Census via Insecure Routers (2012)](http://internetcensus2012.bitbucket.org/paper.html)
|
||||
* [Internet Census via Insecure Routers (2012)](https://internetcensus2012.bitbucket.io/paper.html)
|
||||
* [Looking inside the (Drop) Box (2013)](https://www.usenix.org/system/files/conference/woot13/woot13-kholia.pdf)
|
||||
* [Making Programs Forget: Enforcing Lifetime For Sensitive Data (2011)](https://www.usenix.org/events/hotos11/tech/final_files/Kannan.pdf)
|
||||
* [Breach: Reviving The Crime Attack (2013)](http://breachattack.com/resources/BREACH%20-%20SSL,%20gone%20in%2030%20seconds.pdf)
|
||||
|
||||
7
streaming_algorithms/README.md
Normal file
7
streaming_algorithms/README.md
Normal file
@ -0,0 +1,7 @@
|
||||
## Streaming Algorithms
|
||||
|
||||
[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](http://algo.inria.fr/flajolet/Publications/FlMa85.pdf) by Philppe 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
|
||||
3
systematic_review/README.md
Normal file
3
systematic_review/README.md
Normal file
@ -0,0 +1,3 @@
|
||||
## Systematic Review
|
||||
|
||||
* :scroll: [Systematic Review in Software Engineering](http://www.elizabete.com.br/site/Outros/Entradas/2012/11/19_Revisao_Sistematica_files/ConceitosRevisaoSistematica_Biolchini.pdf)
|
||||
BIN
systematic_review/systematic-review-in-software-engineering.pdf
Normal file
BIN
systematic_review/systematic-review-in-software-engineering.pdf
Normal file
Binary file not shown.
@ -17,7 +17,14 @@ The included documents are:
|
||||
and suitable for stochastic processes. This makes them attractive for
|
||||
processing high-frequency data in finance and other fields. Using a
|
||||
basic set of operators, we easily construct more powerful combined
|
||||
operators which cover a wide set of typical applications.
|
||||
|
||||
operators which cover a wide set of typical applications.
|
||||
|
||||
* [:scroll:](https://github.com/papers-we-love/papers-we-love/blob/master/time_series/ts-asap.pdf)
|
||||
[ASAP: Automatic Smoothing for Attention Prioritization in Streaming Time Series Visualization](http://futuredata.stanford.edu/asap/) - Kexin Rong, Peter Bailis
|
||||
|
||||
Time Series smoothing method to better prioritize attention in time series
|
||||
exploration and monitoring visualizations, smooth the time series as much as
|
||||
possible to remove noise while still retaining large-scale structure. We
|
||||
develop a new technique for automatically smoothing streaming time series
|
||||
that adaptively optimizes this trade-off between noise reduction (i.e.,
|
||||
variance) and outlier retention (i.e., kurtosis).
|
||||
|
||||
BIN
time_series/ts-asap.pdf
Normal file
BIN
time_series/ts-asap.pdf
Normal file
Binary file not shown.
@ -1,3 +1,5 @@
|
||||
# User Interfaces
|
||||
|
||||
[Squeak: a Language for Communicating with Mice](http://ordiecole.com/squeak/cardelli_squeak1985.pdf)
|
||||
* :scroll: [Squeak: a Language for Communicating with Mice](http://ordiecole.com/squeak/cardelli_squeak1985.pdf)
|
||||
|
||||
* :scroll: [Projecting a modular future](http://www.voelter.de/data/pub/projectingModuleFuture.pdf)
|
||||
|
||||
Loading…
Reference in New Issue
Block a user