This commit is contained in:
yawnt 2014-03-28 22:13:37 +01:00
commit 3fd004893a
35 changed files with 170 additions and 59 deletions

View File

@ -6,6 +6,7 @@ Repository related to the following meetups:
* [SF - Papers We Love too](http://www.meetup.com/papers-we-love-too/)
* [London - Papers We Love](http://www.meetup.com/papers-we-love-london)
* [Saint Louis - Papers We Love](http://www.meetup.com/Papers-We-Love-in-saint-louis/)
* [Colorado - Papers We Love](http://www.meetup.com/Papers-We-Love-Boulder/)
Let us know if you are interested in starting a [chapter](https://github.com/papers-we-love/papers-we-love/wiki/Creating-a-PWL-chapter)!
@ -51,11 +52,14 @@ We have a few guidelines in place to keep the repo clean and easy to navigate. W
### Follow the group's ethos
We want to help bring academic research closer to practitioners. Books, blogposts, and/or reference pdfs don't go through the same review process that academic papers do and we won't add them to this repo.
We want to help bring academic research closer to practitioners and we strive to:
* **Keep the quality of papers listed high:** Books, blogposts, and/or reference pdfs don't go through the same review process that academic papers do and we won't add them to this repo.
* **Help people understand why a paper is important:** We ask that you include with your commit an update to the directory README with a short justification of why you love this paper (for example: A paper might be interesting because it spawned a new domain, it was exceptionally well-written, or perhaps it was completely wrong about something.)
### 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 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 naming convention

1
api_design/README.md Normal file
View File

@ -0,0 +1 @@
[REST-Roy-Fielding-dissertation.pdf](https://www.ics.uci.edu/~fielding/pubs/dissertation/fielding_dissertation.pdf)

9
biocomputing/README.md Normal file
View File

@ -0,0 +1,9 @@
##Biocomputing
Some resources that may assist in understanding papers in this section:
- Polymerase Chain Reaction ( [a short video](http://www.youtube.com/watch?v=2KoLnIwoZKU), [wikipedia](http://en.wikipedia.org/wiki/Pcr))
---------
* [Molecular Computation of Solutions to Combinatorial Problems](http://www.cs.duke.edu/courses/cps296.4/spring04/papers/Adleman94.pdf)
- An interesting and inspiring approach to solving the (NP-complete) Hamiltonian Graph problem.

View File

@ -0,0 +1,2 @@
* [Turing, On computable numbers, with an application to the Entscheidungsproblem](http://www.turingarchive.org/browse.php/B/12)
* [Mealy, A Method for Synthesizing Sequential Circuits] (http://www3.alcatel-lucent.com/bstj/vol34-1955/bstj-vol34-issue05.html)

View File

@ -0,0 +1,13 @@
### Rendering
* [An Improved Illumination Model for Shaded Display](https://www.cs.drexel.edu/~david/Classes/CS586/Papers/p343-whitted.pdf)
* [The Rendering Equation](http://x86.cs.duke.edu/courses/cps124/fall09/notes/16_rendering/p143-kajiya.pdf)
* [GigaVoxels : Ray-Guided Streaming for Efficient and Detailed Voxel Rendering](http://maverick.inria.fr/Publications/2009/CNLE09/CNLE09.pdf) - [Web page](http://maverick.inria.fr/Publications/2009/CNLE09/) - [Project page](http://gigavoxels.imag.fr/) - [Video](https://www.youtube.com/watch?v=HScYuRhgEJw)
### Surface reconstruction
* [Poisson surface reconstruction](http://research.microsoft.com/en-us/um/people/hoppe/poissonrecon.pdf) - [Code](http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.71/)
* [KinectFusion: Real-time 3D Reconstruction and Interaction Using a Moving Depth Camera](http://research.microsoft.com/pubs/155416/kinectfusion-uist-comp.pdf)
### 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)

View File

@ -0,0 +1,3 @@
* [Coupled 3D Reconstruction of Sparse Facial Hair and Skin](http://www.disneyresearch.com/project/coupled-3d-reconstruction-of-sparse-facial-hair-and-skin/)
* [High-Quality Single-Shot Capture of Facial Geometry](http://www.disneyresearch.com/project/high-quality-single-shot-capture-of-facial-geometry/)

View File

@ -1,7 +1,7 @@
* [everything-you-always-wanted-to-know-about-synchronization-but-were-afraid-to-ask](http://sigops.org/sosp/sosp13/papers/p33-david.pdf)
* [Everything You Always Wanted to Know About Synchronization but Were Afraid to Ask](http://sigops.org/sosp/sosp13/papers/p33-david.pdf)
* [time-clocks-and-the-ordering-of-event-in-a-distributed-system](http://www.stanford.edu/class/cs240/readings/lamport.pdf)
* [Time, Clocks, and the Ordering of Event in a Distributed System](http://www.stanford.edu/class/cs240/readings/lamport.pdf)
* [heap-architectures-for-concurrent-languages-using-message-passing](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.1302&rep=rep1&type=pdf)
* [Heap Architectures For Concurrent Languages Using Message Passing](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.1302&rep=rep1&type=pdf)
* [message-analysis-for-concurrent-languages](http://user.it.uu.se/~kostis/Papers/escape.pdf)
* [Message Analysis for Concurrent Languages](http://user.it.uu.se/~kostis/Papers/escape.pdf)

View File

@ -0,0 +1,11 @@
* [Everything You Always Wanted to Know About Synchronization but Were Afraid to Ask](http://sigops.org/sosp/sosp13/papers/p33-david.pdf)
<<<<<<< HEAD
* [time-clocks-and-the-ordering-of-event-in-a-distributed-system](http://www.stanford.edu/class/cs240/readings/lamport.pdf)
* [heap-architectures-for-concurrent-languages-using-message-passing](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.1302&rep=rep1&type=pdf)
* [message-analysis-for-concurrent-languages](http://user.it.uu.se/~kostis/Papers/escape.pdf)
=======
* [Time, Clocks, and the Ordering of Events in a Distributed System](http://www.stanford.edu/class/cs240/readings/lamport.pdf)
>>>>>>> c371233d03c8597fc7f9f0e1799a7e7fab9eccb7

View File

@ -0,0 +1,3 @@
* [everything-you-always-wanted-to-know-about-synchronization-but-were-afraid-to-ask](http://sigops.org/sosp/sosp13/papers/p33-david.pdf)
* [time-clocks-and-the-ordering-of-event-in-a-distributed-system](http://www.stanford.edu/class/cs240/readings/lamport.pdf)

View File

@ -0,0 +1,7 @@
* [everything-you-always-wanted-to-know-about-synchronization-but-were-afraid-to-ask](http://sigops.org/sosp/sosp13/papers/p33-david.pdf)
* [time-clocks-and-the-ordering-of-event-in-a-distributed-system](http://www.stanford.edu/class/cs240/readings/lamport.pdf)
* [heap-architectures-for-concurrent-languages-using-message-passing](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.1302&rep=rep1&type=pdf)
* [message-analysis-for-concurrent-languages](http://user.it.uu.se/~kostis/Papers/escape.pdf)

View File

@ -0,0 +1,3 @@
* [Everything You Always Wanted to Know About Synchronization but Were Afraid to Ask](http://sigops.org/sosp/sosp13/papers/p33-david.pdf)
* [Time, Clocks, and the Ordering of Events in a Distributed System](http://www.stanford.edu/class/cs240/readings/lamport.pdf)

View File

@ -0,0 +1,11 @@
* [Everything You Always Wanted to Know About Synchronization but Were Afraid to Ask](http://sigops.org/sosp/sosp13/papers/p33-david.pdf)
<<<<<<< HEAD
* [time-clocks-and-the-ordering-of-event-in-a-distributed-system](http://www.stanford.edu/class/cs240/readings/lamport.pdf)
* [heap-architectures-for-concurrent-languages-using-message-passing](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.1302&rep=rep1&type=pdf)
* [message-analysis-for-concurrent-languages](http://user.it.uu.se/~kostis/Papers/escape.pdf)
=======
* [Time, Clocks, and the Ordering of Events in a Distributed System](http://www.stanford.edu/class/cs240/readings/lamport.pdf)
>>>>>>> c371233d03c8597fc7f9f0e1799a7e7fab9eccb7

2
cryptography/README.md Normal file
View File

@ -0,0 +1,2 @@
* [A Method for Obtaining Digital Signatures and Public-Key Cryptosystems](http://people.csail.mit.edu/rivest/Rsapaper.pdf)
* [Twenty Years of Attacks on the RSA Cryptosystem](https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf)

View File

@ -1 +1,2 @@
* [dynamic-hash-tables](http://www.csd.uoc.gr/~hy460/pdf/Dynamic%20Hash%20Tables.pdf)
* [Dynamic Hash Tables](http://www.csd.uoc.gr/~hy460/pdf/Dynamic%20Hash%20Tables.pdf)
* [Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms](http://www.research.ibm.com/people/m/michael/podc-1996.pdf)

View File

@ -1 +1 @@
* [calvin-fast-distributed-transactions-for-partitioned-database-systems](http://cs.yale.edu/homes/thomson/publications/calvin-sigmod12.pdf)
* [Calvin: Fast Distributed Transactions for Partitioned Database Systems](http://cs.yale.edu/homes/thomson/publications/calvin-sigmod12.pdf)

1
design/README.md Normal file
View File

@ -0,0 +1 @@
* [Traits: A Mechanism for Fine-Grained Reuse](http://scg.unibe.ch/archive/papers/Duca06bTOPLASTraits.pdf)

View File

@ -1,69 +1,79 @@
* [millwheel-fault-tolerant-stream-processing-at-internet-scale](http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/41378.pdf)
# Distributed Systems
* [a-simple-totally-ordered-broadcast-protocol](http://labs.yahoo.com/files/ladis08.pdf)
## External Papers
* [cassandra-a-decentralized-structured-storage-system](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.161.6751&rep=rep1&type=pdf)
* [A simple totally ordered broadcast protocol](http://labs.yahoo.com/files/ladis08.pdf)
* [chord-algorithm](http://pdos.csail.mit.edu/papers/chord:sigcomm01/chord_sigcomm.pdf)
* [Cassandra - A Decentralized Structured Storage System](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.161.6751&rep=rep1&type=pdf)
* [crush](http://www.ssrc.ucsc.edu/Papers/weil-sc06.pdf)
* [Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications](http://pdos.csail.mit.edu/papers/chord:sigcomm01/chord_sigcomm.pdf)
* [dont-settle-for-eventual-scalable-causal-consistency-for-wide-area-storage-with-cops](http://www.cs.cmu.edu/~dga/papers/cops-sosp2011.pdf)
* [CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data](http://www.ssrc.ucsc.edu/Papers/weil-sc06.pdf)
* [dremel-interactive-analysis-of-web-scale-datasets](http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/36632.pdf)
* [Dont Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS](http://www.cs.cmu.edu/~dga/papers/cops-sosp2011.pdf)
* [f1-a-distributed-sql-database-that-scales](http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/41344.pdf)
* [Dremel: Interactive Analysis of Web-Scale Datasets](http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/36632.pdf)
* [haloop](http://www.ics.uci.edu/~yingyib/papers/HaLoop_camera_ready.pdf)
* [F1: A Distributed SQL Database That Scales](http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/41344.pdf)
* [hoard-a-scalable-memory-allocator-for-multithreaded-applications](http://people.cs.umass.edu/~emery/pubs/berger-asplos2000.pdf)
* [HaLoop: Efficient Iterative Data Processing on Large Clusters](http://www.ics.uci.edu/~yingyib/papers/HaLoop_camera_ready.pdf)
* [hyperdex](https://cs.uwaterloo.ca/~bernard/hyperdex.pdf)
* [Hoard: A Scalable Memory Allocator for Multithreaded Applications](http://people.cs.umass.edu/~emery/pubs/berger-asplos2000.pdf)
* [implementing-fault-tolerant-services-using-the-state-machine-approach-a-tutorial](https://www.cs.cornell.edu/fbs/publications/SMSurvey.pdf)
* [HyperDex: A Distributed, Searchable Key-Value Store](https://cs.uwaterloo.ca/~bernard/hyperdex.pdf)
* [kafka-distributed-messaging-system-for-log-processing](http://research.microsoft.com/en-us/um/people/srikanth/netdb11/netdb11papers/netdb11-final12.pdf)
* [Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial](https://www.cs.cornell.edu/fbs/publications/SMSurvey.pdf)
* [linearizability-a-correctness-condition-for-concurrent-objects](http://cs.brown.edu/~mph/HerlihyW90/p463-herlihy.pdf)
* [Kafka: a Distributed Messaging System for Log Processing](http://research.microsoft.com/en-us/um/people/srikanth/netdb11/netdb11papers/netdb11-final12.pdf)
* [managing-update-conflicts-in-bayou](http://zoo.cs.yale.edu/classes/cs422/2013/bib/terry95managing.pdf)
* [Linearizability: A Correctness Condition for Concurrent Objects](http://cs.brown.edu/~mph/HerlihyW90/p463-herlihy.pdf)
* [map-reduce-merge](http://www.cs.duke.edu/courses/cps399.28/current/papers/sigmod07-YangDasdanEtAl-map_reduce_merge.pdf)
* [Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System](http://zoo.cs.yale.edu/classes/cs422/2013/bib/terry95managing.pdf)
* [mdcc-multi-data-center-consistency](https://amplab.cs.berkeley.edu/wp-content/uploads/2013/03/mdcc-eurosys13.pdf)
* [Map-Reduce-Merge: Simplified Relational Data Processing on Large Clusters](http://www.cs.duke.edu/courses/cps399.28/current/papers/sigmod07-YangDasdanEtAl-map_reduce_merge.pdf)
* [optimistic-replication](http://pages.cs.wisc.edu/~remzi/Classes/739/Spring2004/Papers/optimistic-survey.pdf)
* [MDCC: Multi-Data Center Consistency](https://amplab.cs.berkeley.edu/wp-content/uploads/2013/03/mdcc-eurosys13.pdf)
* [paxos-made-live](http://www.cs.utexas.edu/users/lorenzo/corsi/cs380d/papers/paper2-1.pdf)
* [MillWheel: Fault-Tolerant Stream Processing at Internet Scale](http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/41378.pdf)
* [practical-byzantine-fault-tolerance-and-proactive-recovery](http://www.itu.dk/stud/speciale/bepjea/xwebtex/litt/practical-byzantine-fault-tolerance-and-proactive-recovery.pdf)
* [Optimistic replication](http://pages.cs.wisc.edu/~remzi/Classes/739/Spring2004/Papers/optimistic-survey.pdf)
* [pregel-a-system-for-large-scale-graph-processing](http://kowshik.github.io/JPregel/pregel_paper.pdf)
* [Paxos Made Live - An Engineering Perspective](http://www.cs.utexas.edu/users/lorenzo/corsi/cs380d/papers/paper2-1.pdf)
* [replication-history-and-grafting-in-the-ori-file-system](http://sigops.org/sosp/sosp13/papers/p151-mashtizadeh.pdf)
* [Practical Byzantine Fault Tolerance and Proactive Recovery](http://www.itu.dk/stud/speciale/bepjea/xwebtex/litt/practical-byzantine-fault-tolerance-and-proactive-recovery.pdf)
* [resilient-overlay-networks](http://nms.lcs.mit.edu/papers/ron-sosp2001.pdf)
* [Pregel: A System for Large-Scale Graph Processing](http://kowshik.github.io/JPregel/pregel_paper.pdf)
* [sinfonia-a-new-paradigm-for-building-scalable-distributed-systems](http://research.microsoft.com/en-us/people/aguilera/sinfonia-aguilera-sosp2007.pdf)
* [Replication, History, and Grafting in the Ori File System](http://sigops.org/sosp/sosp13/papers/p151-mashtizadeh.pdf)
* [the-byzantine-generals-problem](http://www.andrew.cmu.edu/course/15-749/READINGS/required/resilience/lamport82.pdf)
* [Resilient Overlay Networks](http://nms.lcs.mit.edu/papers/ron-sosp2001.pdf)
* [the-dangers-of-replication-and-a-solution](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.21.2707&rep=rep1&type=pdf)
* [Sinfonia: A New Paradigm for Building Scalable Distributed Systems](http://research.microsoft.com/en-us/people/aguilera/sinfonia-aguilera-sosp2007.pdf)
* [the-part-time-parliament](http://research.microsoft.com/en-us/um/people/lamport/pubs/lamport-paxos.pdf)
* [The Byzantine Generals Problem](http://www.andrew.cmu.edu/course/15-749/READINGS/required/resilience/lamport82.pdf)
* [there-is-more-consensus-in-egalitarian-parliaments-(egalitarian-paxos)](https://www.cs.cmu.edu/~dga/papers/epaxos-sosp2013.pdf)
* [The Dangers of Replication and a Solution](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.21.2707&rep=rep1&type=pdf)
* [towards-a-next-generation-data-center-architecture-scalability-and-commoditization](http://research.microsoft.com/pubs/79348/presto27-greenberg.pdf)
* [The Part-Time Parliament](http://research.microsoft.com/en-us/um/people/lamport/pubs/lamport-paxos.pdf)
* [transactional-client-server-cache-consistency-alternatives-and-performance](http://www.cs.berkeley.edu/~franklin/Papers/p315-franklin.pdf)
* [There Is More Consensus in Egalitarian Parliaments](https://www.cs.cmu.edu/~dga/papers/epaxos-sosp2013.pdf)
* [unicorn-a-system-for-searching-the-social-graph](http://db.disi.unitn.eu/pages/VLDBProgram/pdf/industry/p871-curtiss.pdf)
* [Towards a Next Generation Data Center Architecture: Scalability and Commoditization](http://research.microsoft.com/pubs/79348/presto27-greenberg.pdf)
* [unikernels-library-operating-systems-for-the-cloud](http://anil.recoil.org/papers/2013-asplos-mirage.pdf)
* [Transactional Client-Server Cache Consistency: Alternatives and Performance](http://www.cs.berkeley.edu/~franklin/Papers/p315-franklin.pdf)
* [untraceable-electronic-mail-return-addresses-and-digital-pseudonyms](http://www.cs.utexas.edu/~shmat/courses/cs395t_fall04/chaum81.pdf)
* [Unicorn: A System for Searching the Social Graph](http://db.disi.unitn.eu/pages/VLDBProgram/pdf/industry/p871-curtiss.pdf)
* [viewstamped-replication](http://www.pmg.csail.mit.edu/papers/vr.pdf)
* [Unikernels: Library Operating Systems for the Cloud](http://anil.recoil.org/papers/2013-asplos-mirage.pdf)
* [vl2-a-scalable-and-flexible-data-center-network](http://research.microsoft.com/pubs/80693/vl2-sigcomm09-final.pdf)
* [Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms](http://www.cs.utexas.edu/~shmat/courses/cs395t_fall04/chaum81.pdf)
* [Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems](http://www.pmg.csail.mit.edu/papers/vr.pdf)
* [VL2: A Scalable and Flexible Data Center Network](http://research.microsoft.com/pubs/80693/vl2-sigcomm09-final.pdf)
## Related Works
### [“On the Electrodynamics of Moving Bodies” (1905) — Einstein](../historical/physics/on-the-electrodynamics-of-moving-bodies.pdf)
By solving the [asymmetries](http://en.wikipedia.org/wiki/Moving_magnet_and_conductor_problem) that arise in Maxwells equations, Einsteins 1905 paper set the stage for current distributed systems work by demonstrating that there is no absolute frame of reference and by providing an upper bound on the speed of communication.

View File

@ -1 +1 @@
* [reflections-on-trusting-trust](http://www.ece.cmu.edu/~ganger/712.fall02/papers/p761-thompson.pdf)
* [Reflections on Trusting Trust](http://www.ece.cmu.edu/~ganger/712.fall02/papers/p761-thompson.pdf)

View File

@ -1,5 +1,5 @@
* [asynchronous-functional-reactive-programming-for-guis](http://people.seas.harvard.edu/~chong/pubs/pldi13-elm.pdf)
* [Asynchronous Functional Reactive Programming for GUIs](http://people.seas.harvard.edu/~chong/pubs/pldi13-elm.pdf)
* [push-pull-frp](http://conal.net/papers/push-pull-frp/push-pull-frp.pdf)
* [Push-Pull Functional Reactive Programming](http://conal.net/papers/push-pull-frp/push-pull-frp.pdf)
* [wormholes-introducing-effects-to-frp](http://haskell.cs.yale.edu/wp-content/uploads/2012/08/Winograd-Cort-Wormholes.pdf)
* [Wormholes: Introducing Effects to FRP](http://haskell.cs.yale.edu/wp-content/uploads/2012/08/Winograd-Cort-Wormholes.pdf)

View File

@ -1,5 +1,5 @@
* [a-unified-theory-of-garbage-collection](http://www.cs.virginia.edu/~cs415/reading/bacon-garbage.pdf)
* [A Unified Theory of Garbage Collection](http://www.cs.virginia.edu/~cs415/reading/bacon-garbage.pdf)
* [teaching-garbage-collection-without-implementing-compilers-or-interpreters](http://faculty.cs.byu.edu/~jay/static/cooper-sigcse2013.pdf)
* [Teaching Garbage Collection Without Implementing Compilers o Interpreters](http://faculty.cs.byu.edu/~jay/static/cooper-sigcse2013.pdf)
* [message-analysis-guided-allocation-and-low-pause-incremental-GC-in-a-concurrent-language](http://user.it.uu.se/~kostis/Papers/ismm04.pdf)
* [Message Analysis Guided Allocation and Low Pause Incremental GC in a Concurrent Language](http://user.it.uu.se/~kostis/Papers/ismm04.pdf)

View File

@ -0,0 +1,9 @@
* [A Unified Theory of Garbage Collection](http://www.cs.virginia.edu/~cs415/reading/bacon-garbage.pdf)
<<<<<<< HEAD
* [teaching-garbage-collection-without-implementing-compilers-or-interpreters](http://faculty.cs.byu.edu/~jay/static/cooper-sigcse2013.pdf)
* [message-analysis-guided-allocation-and-low-pause-incremental-GC-in-a-concurrent-language](http://user.it.uu.se/~kostis/Papers/ismm04.pdf)
=======
* [Teaching Garbage Collection without Implementing Compilers or Interpreters](http://faculty.cs.byu.edu/~jay/static/cooper-sigcse2013.pdf)
>>>>>>> c371233d03c8597fc7f9f0e1799a7e7fab9eccb7

View File

@ -0,0 +1,19 @@
## Information Retrieval
Information retrieval is the activity of obtaining information resources relevant to an information need from a collection of information resources. (Says Wikipedia).
The included documents are
*
[Graph of Word and TW-IDF](http://www.lix.polytechnique.fr/~rousseau/papers/rousseau-cikm2013.pdf) - Francois Rousseau & Michalis Vazirgiannis
The traditional IR system stores term-specific statistics (typically
a term's frequency in each document - which we call TF) in an index.
Such a model ignores dependencies between terms and considers a
document's terms to occur independently of each other (and is aptly
called the bag-of-words model). In this paper the authors use a
statistic that uses a graph representation of a document to encode
dependencies between terms and replace the TF statistic with a new
TW statistic based on the graph constructed and achieve
significantly better results that popular existing models. This
paper won a honorable mention at CIKM 2013.

Binary file not shown.

View File

@ -1 +1 @@
* [purely-functional-lazy-non-deterministic-programming](http://www.cs.rutgers.edu/~ccshan/rational/lazy-nondet.pdf)
* [Purely Functional Lazy Non-deterministic Programming](http://www.cs.rutgers.edu/~ccshan/rational/lazy-nondet.pdf)

View File

@ -1 +1 @@
* [fortyifying-macros](http://www.ccs.neu.edu/racket/pubs/icfp10-cf.pdf)
* [Fortifying Macros](http://www.ccs.neu.edu/racket/pubs/icfp10-cf.pdf)

View File

@ -1 +1 @@
* [bimodal-multicast](http://www.csl.mtu.edu/cs6461/www/Reading/Birman99.pdf)
* [Bimodal Multicast](http://www.csl.mtu.edu/cs6461/www/Reading/Birman99.pdf)

View File

@ -1 +1 @@
* [xen-and-the-art-of-virtualization](http://www.cl.cam.ac.uk/research/srg/netos/papers/2003-xensosp.pdf)
* [Xen and the Art of Virtualization](http://www.cl.cam.ac.uk/research/srg/netos/papers/2003-xensosp.pdf)

View File

@ -1 +1,3 @@
* [can-programming-be-liberated-from-the-von-neumann-style](http://www.thocp.net/biographies/papers/backus_turingaward_lecture.pdf)
* [Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs](http://www.thocp.net/biographies/papers/backus_turingaward_lecture.pdf)
* [Programming and Reasoning with Algebraic Effects and Dependent Types](http://eb.host.cs.st-andrews.ac.uk/drafts/effects.pdf)

View File

@ -1 +1 @@
* [communicating-sequential-processes](http://www.cs.ucf.edu/courses/cop4020/sum2009/CSP-hoare.pdf)
* [Communicating Sequential Processes](http://www.cs.ucf.edu/courses/cop4020/sum2009/CSP-hoare.pdf)