It seems to be thoughtfully designed (with a long article explaining the considerations), follows academic practices, and simply is genuinely helpful. https://allenai.org/blog/paper-finder It builds on #SemanticScholar and verifies #GenAI output against an actual database of academic publications. 2/
Analysis of Three Bayesian Network Inference Algorithms : Variable Elimination , Likelihood Weighting , and Gibbs Sampling [2004]
By: Rose F. Liu, Rusmin Soetjipto
https://github.com/papers-we-love/papers-we-love/blob/master/artificial_intelligence/3-bayesian-network-inference-algorithm.pdf
https://www.semanticscholar.org/paper/ac14e6bf50d1491043baf1d854727a68f5f3f51d
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 https://semanticscholar.org, which I highly recommend. They support you much better in curating your profile than any similar service I know.
Parallel generational-copying garbage collection with a block-structured heap [2008]
By: S. Marlow, T. Harris, Roshan P. James, et al.
https://github.com/papers-we-love/papers-we-love/blob/master/garbage_collection/parallel_generational_copying_garbage_collection_with_a_block_structured_heap.pdf https://www.semanticscholar.org/paper/839ef90d70e4779a4b6795b06f314294ea539add
Dynamo: amazon's highly available key-value store [2007]
By: Giuseppe deCandia, Deniz Hastorun, M. Jampani, et al.
https://github.com/papers-we-love/papers-we-love/blob/master/datastores/dynamo-amazons-highly-available-key-value-store.pdf https://www.semanticscholar.org/paper/7d906f6632f8740b540ce4d710f53ab0f97cfd5b
The Least Common Ancestor Problem [2003]
By: S. Kiefer
https://github.com/papers-we-love/papers-we-love/blob/master/data_structures/lca-revisited.pdf https://www.semanticscholar.org/paper/a1e3488135a9c0dd78755f6522dbcce0de0aa8e8
Making lockless synchronization fast: performance implications of memory reclamation [2006]
By: Thomas E. Hart, P. McKenney, Angela Demke Brown
https://github.com/papers-we-love/papers-we-love/blob/master/memory_management/making-lockless-synchronization-fast.pdf https://www.semanticscholar.org/paper/066dcd039e4c2a27c72a19a70a28475fb7ae557f
Chain Replication for Supporting High Throughput and Availability [2004]
By: R. V. Renesse, F. Schneider
https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/chain-replication-for-supporting-high-throughput-and-availability.pdf https://www.semanticscholar.org/paper/9a091dacf855c1b6a0cd4361194e238fe6e1ff11
Logicism and the Meanings of Logical Constants [2016]
By: P. J. Young
https://github.com/papers-we-love/papers-we-love/blob/master/logic_and_programming/on-the-meanings-of-the-logical-constants.pdf https://www.semanticscholar.org/paper/54b4a4cd2343daa9cb820f78c8d45bec2f863481
Practical Optional Types for Clojure [2016]
By: Ambrose Bonnaire-Sergeant, Rowan Davies, S. Tobin-Hochstadt
https://github.com/papers-we-love/papers-we-love/blob/master/languages/clojure/a-practical-optional-type-system-for-clojure.pdf https://www.semanticscholar.org/paper/8f98a34a2ac0a399c5d11955e68522b0ef47579f
Tracking via Geotagged Social Media Data [2020]
By: A. Hardy
https://github.com/papers-we-love/papers-we-love/blob/master/api_design/api-design.pdf https://www.semanticscholar.org/paper/c1d01edd5ae60ba186474f6e7673053e6e1252ad
Dynamo: amazon's highly available key-value store [2007]
By: Giuseppe deCandia, Deniz Hastorun, M. Jampani, et al.
https://github.com/papers-we-love/papers-we-love/blob/master/datastores/dynamo-amazons-highly-available-key-value-store.pdf https://www.semanticscholar.org/paper/7d906f6632f8740b540ce4d710f53ab0f97cfd5b
Security with privacy - A research agenda [2014]
By: E. Bertino, Bharath K. Samanthula
https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/towards-a-cloud-computing-research-agenda.pdf https://www.semanticscholar.org/paper/ab08945b087284e2ca14a3918a617a6f18c14874
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services [2002]
By: Seth Gilbert, N. Lynch
https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/brewers-conjecture.pdf https://www.semanticscholar.org/paper/bbe7a291e74d12d0bcad6f623d8a13e084b83255
A program optimization for automatic database result caching [2017]
By: Ziv Scully, A. Chlipala
https://github.com/papers-we-love/papers-we-love/blob/master/caching/a-program-optimization-for-automatic-database-result-caching.pdf https://www.semanticscholar.org/paper/c84e6cc11d1a18d7f792bdefaf064dfe7c734728
Fast Error-Bounded Lossy HPC Data Compression with SZ [2016]
By: Sheng Di, F. Cappello
https://github.com/papers-we-love/papers-we-love/blob/master/data_compression/fast_error_bounded_Lossy_hpc_data_compression_with_sz.pdf https://www.semanticscholar.org/paper/093fc19d440f33247e545ec6c047e0aa0afb0863
Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error-Controlled Quantization [2017]
By: Dingwen Tao, Sheng Di, Zizhong Chen, et al.
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 https://www.semanticscholar.org/paper/4370744924f3bd3915a0baa8b4d1d217d4dc4649
Byzantine Chain Replication [2012]
By: R. V. Renesse, Chi Ho, Nicolas Schiper
https://github.com/papers-we-love/papers-we-love/blob/master/distributed_systems/byzantine-chain-replication.pdf https://www.semanticscholar.org/paper/d6e2f645f41502b1f8c12935918d4d2642dab629
The Least Common Ancestor Problem [2003]
By: S. Kiefer
https://github.com/papers-we-love/papers-we-love/blob/master/data_structures/lca-revisited.pdf https://www.semanticscholar.org/paper/a1e3488135a9c0dd78755f6522dbcce0de0aa8e8
