med-mastodon.com is one of the many independent Mastodon servers you can use to participate in the fediverse.
Medical community on Mastodon

Administered by:

Server stats:

362
active users

#semanticscholar

0 posts0 participants0 posts today
Papers We Love<p>📜 A Byzantine Fault Tolerant Distributed Commit Protocol [2007]</p><p>By: Wenbing Zhao</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/byzantine-fault-tolerant-distributed-commit-protocol.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/distributed_systems/byzantine-fault-tolerant-distributed-commit-protocol.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/ebb685399ffe65d1b3119ada60fdf002cfac66f9" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/ebb6</span><span class="invisible">85399ffe65d1b3119ada60fdf002cfac66f9</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 A New Approach to Linear Filtering and Prediction Problems [2001]</p><p>By: T. Başar</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/data_fusion/a-new-approach-to-linear-filtering-and-prediction-problems.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/data_fusion/a-new-approach-to-linear-filtering-and-prediction-problems.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/d36a38125557764efb0fd2b3ef0a4cde515b3861" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/d36a</span><span class="invisible">38125557764efb0fd2b3ef0a4cde515b3861</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Frederik Elwert<p>It seems to be thoughtfully designed (with a long article explaining the considerations), follows academic practices, and simply is genuinely helpful. <a href="https://allenai.org/blog/paper-finder" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">allenai.org/blog/paper-finder</span><span class="invisible"></span></a> It builds on <a href="https://fedihum.org/tags/SemanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>SemanticScholar</span></a> and verifies <a href="https://fedihum.org/tags/GenAI" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>GenAI</span></a> output against an actual database of academic publications. 2/</p>
Papers We Love<p>📜 Analysis of Three Bayesian Network Inference Algorithms : Variable Elimination , Likelihood Weighting , and Gibbs Sampling [2004]</p><p>By: Rose F. Liu, Rusmin Soetjipto</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/artificial_intelligence/3-bayesian-network-inference-algorithm.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/artificial_intelligence/3-bayesian-network-inference-algorithm.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/ac14e6bf50d1491043baf1d854727a68f5f3f51d" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/ac14</span><span class="invisible">e6bf50d1491043baf1d854727a68f5f3f51d</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Christof Schöch<p><span class="h-card" translate="no"><a href="https://fedihum.org/@stefan_hessbrueggen" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>stefan_hessbrueggen</span></a></span> </p><p>Yep, that's good at least. I just think a lot of people still use GS, for example for topic alerts. I still do, although my favorite source for this is now actually <a href="https://semanticscholar.org" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">semanticscholar.org</span><span class="invisible"></span></a>, which I highly recommend. They support you much better in curating your profile than any similar service I know. </p><p><a href="https://fedihum.org/tags/semanticscholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticscholar</span></a></p>
Papers We Love<p>📜 Parallel generational-copying garbage collection with a block-structured heap [2008]</p><p>By: S. Marlow, T. Harris, Roshan P. James, et al.</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/garbage_collection/parallel_generational_copying_garbage_collection_with_a_block_structured_heap.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/garbage_collection/parallel_generational_copying_garbage_collection_with_a_block_structured_heap.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/839ef90d70e4779a4b6795b06f314294ea539add" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/839e</span><span class="invisible">f90d70e4779a4b6795b06f314294ea539add</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Dynamo: amazon's highly available key-value store [2007]</p><p>By: Giuseppe deCandia, Deniz Hastorun, M. Jampani, et al.</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/datastores/dynamo-amazons-highly-available-key-value-store.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/datastores/dynamo-amazons-highly-available-key-value-store.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/7d906f6632f8740b540ce4d710f53ab0f97cfd5b" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/7d90</span><span class="invisible">6f6632f8740b540ce4d710f53ab0f97cfd5b</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Early LISP history (1956 - 1959) [1984]</p><p>By: H. Stoyan</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/comp_sci_fundamentals_and_history/early-lisp-history-1956-1959-herbert-stoyan-html-rendering.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/comp_sci_fundamentals_and_history/early-lisp-history-1956-1959-herbert-stoyan-html-rendering.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/7a583f10c0211ca4ff3517f60f08f9b489ddcf63" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/7a58</span><span class="invisible">3f10c0211ca4ff3517f60f08f9b489ddcf63</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 The Least Common Ancestor Problem [2003]</p><p>By: S. Kiefer</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/data_structures/lca-revisited.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/data_structures/lca-revisited.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/a1e3488135a9c0dd78755f6522dbcce0de0aa8e8" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/a1e3</span><span class="invisible">488135a9c0dd78755f6522dbcce0de0aa8e8</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Making lockless synchronization fast: performance implications of memory reclamation [2006]</p><p>By: Thomas E. Hart, P. McKenney, Angela Demke Brown</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/memory_management/making-lockless-synchronization-fast.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/memory_management/making-lockless-synchronization-fast.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/066dcd039e4c2a27c72a19a70a28475fb7ae557f" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/066d</span><span class="invisible">cd039e4c2a27c72a19a70a28475fb7ae557f</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Chain Replication for Supporting High Throughput and Availability [2004]</p><p>By: R. V. Renesse, F. Schneider</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/chain-replication-for-supporting-high-throughput-and-availability.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/distributed_systems/chain-replication-for-supporting-high-throughput-and-availability.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/9a091dacf855c1b6a0cd4361194e238fe6e1ff11" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/9a09</span><span class="invisible">1dacf855c1b6a0cd4361194e238fe6e1ff11</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Logicism and the Meanings of Logical Constants [2016]</p><p>By: P. J. Young</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/logic_and_programming/on-the-meanings-of-the-logical-constants.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/logic_and_programming/on-the-meanings-of-the-logical-constants.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/54b4a4cd2343daa9cb820f78c8d45bec2f863481" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/54b4</span><span class="invisible">a4cd2343daa9cb820f78c8d45bec2f863481</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Practical Optional Types for Clojure [2016]</p><p>By: Ambrose Bonnaire-Sergeant, Rowan Davies, S. Tobin-Hochstadt</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/languages/clojure/a-practical-optional-type-system-for-clojure.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/languages/clojure/a-practical-optional-type-system-for-clojure.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/8f98a34a2ac0a399c5d11955e68522b0ef47579f" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/8f98</span><span class="invisible">a34a2ac0a399c5d11955e68522b0ef47579f</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Tracking via Geotagged Social Media Data [2020]</p><p>By: A. Hardy</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/api_design/api-design.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/api_design/api-design.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/c1d01edd5ae60ba186474f6e7673053e6e1252ad" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/c1d0</span><span class="invisible">1edd5ae60ba186474f6e7673053e6e1252ad</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Dynamo: amazon's highly available key-value store [2007]</p><p>By: Giuseppe deCandia, Deniz Hastorun, M. Jampani, et al.</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/datastores/dynamo-amazons-highly-available-key-value-store.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/datastores/dynamo-amazons-highly-available-key-value-store.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/7d906f6632f8740b540ce4d710f53ab0f97cfd5b" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/7d90</span><span class="invisible">6f6632f8740b540ce4d710f53ab0f97cfd5b</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Security with privacy - A research agenda [2014]</p><p>By: E. Bertino, Bharath K. Samanthula</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/towards-a-cloud-computing-research-agenda.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/distributed_systems/towards-a-cloud-computing-research-agenda.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/ab08945b087284e2ca14a3918a617a6f18c14874" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/ab08</span><span class="invisible">945b087284e2ca14a3918a617a6f18c14874</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services [2002]</p><p>By: Seth Gilbert, N. Lynch</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/brewers-conjecture.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/distributed_systems/brewers-conjecture.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/bbe7a291e74d12d0bcad6f623d8a13e084b83255" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/bbe7</span><span class="invisible">a291e74d12d0bcad6f623d8a13e084b83255</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 A program optimization for automatic database result caching [2017]</p><p>By: Ziv Scully, A. Chlipala</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/caching/a-program-optimization-for-automatic-database-result-caching.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/caching/a-program-optimization-for-automatic-database-result-caching.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/c84e6cc11d1a18d7f792bdefaf064dfe7c734728" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/c84e</span><span class="invisible">6cc11d1a18d7f792bdefaf064dfe7c734728</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Fast Error-Bounded Lossy HPC Data Compression with SZ [2016]</p><p>By: Sheng Di, F. Cappello</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/data_compression/fast_error_bounded_Lossy_hpc_data_compression_with_sz.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/data_compression/fast_error_bounded_Lossy_hpc_data_compression_with_sz.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/093fc19d440f33247e545ec6c047e0aa0afb0863" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/093f</span><span class="invisible">c19d440f33247e545ec6c047e0aa0afb0863</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>
Papers We Love<p>📜 Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error-Controlled Quantization [2017]</p><p>By: Dingwen Tao, Sheng Di, Zizhong Chen, et al.</p><p>📖 <a href="https://github.com/papers-we-love/papers-we-love/blob/master/data_compression/Significantly_Improving_Lossy_Compression_for_Scientific_Data_Sets_Based_on_Multidimensional_Prediction_and_Error-Controlled_Quantization.pdf" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/papers-we-love/pape</span><span class="invisible">rs-we-love/blob/master/data_compression/Significantly_Improving_Lossy_Compression_for_Scientific_Data_Sets_Based_on_Multidimensional_Prediction_and_Error-Controlled_Quantization.pdf</span></a><br>🔍 <a href="https://www.semanticscholar.org/paper/4370744924f3bd3915a0baa8b4d1d217d4dc4649" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">semanticscholar.org/paper/4370</span><span class="invisible">744924f3bd3915a0baa8b4d1d217d4dc4649</span></a></p><p><a href="https://mstdn.io/tags/semanticScholar" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>semanticScholar</span></a> <a href="https://mstdn.io/tags/paperswelove" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>paperswelove</span></a> <a href="https://mstdn.io/tags/research" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>research</span></a> <a href="https://mstdn.io/tags/compsci" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compsci</span></a></p>