Results 221 to 230 of about 133,755 (277)
Correction: What is the nature of cache memory in Parids? A comment on Chettih et al. 2024. [PDF]
Anim CognSmulders TV, Cheng S.
europepmc +1 more source
Bridging the preparedness gap: a systematic review of recommended stockpile items for radiological and nuclear emergencies. [PDF]
BMC Emerg MedNocci M +13 more
europepmc +1 more source
Targeting mGlyR with nanobodies for depression. [PDF]
Nat CommunLaboute T +12 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Prompt Cache: Modular Attention Reuse for Low-Latency Inference
Conference on Machine Learning and Systems, 2023We present Prompt Cache, an approach for accelerating inference for large language models (LLM) by reusing attention states across different LLM prompts.
In Gim +5 more
semanticscholar +1 more source
Faa$T: A Transparent Auto-Scaling Cache for Serverless Applications
ACM Symposium on Cloud Computing, 2021Function-as-a-Service (FaaS) has become an increasingly popular way for users to deploy their applications without the burden of managing the underlying infrastructure.
Francisco Romero +8 more
semanticscholar +1 more source
LeaD: Large-Scale Edge Cache Deployment Based on Spatio-Temporal WiFi Traffic Statistics
IEEE Transactions on Mobile Computing, 2021Widespread and large-scale WiFi systems have been deployed in many corporate locations, while the backhual capacity becomes the bottleneck in providing high-rate data services to a tremendous number of WiFi users.
Feng Lyu +6 more
semanticscholar +1 more source
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2009
We introduce the similarity caching problem, a variant of classical caching in which an algorithm can return an element from the cache that is similar, but not necessarily identical, to the query element. We are motivated by buffer management questions in approximate nearest-neighbor applications, especially in the context of caching targeted ...
CHIERICHETTI, FLAVIO +2 more
openaire +1 more source
We introduce the similarity caching problem, a variant of classical caching in which an algorithm can return an element from the cache that is similar, but not necessarily identical, to the query element. We are motivated by buffer management questions in approximate nearest-neighbor applications, especially in the context of caching targeted ...
CHIERICHETTI, FLAVIO +2 more
openaire +1 more source