Results 61 to 70 of about 5,314 (170)
Parallel Algorithms for Summing Floating-Point Numbers
, 2016 The problem of exactly summing n floating-point numbers is a fundamental problem that has many applications in large-scale simulations and computational geometry.
Eldawy, Ahmed, Goodrich, Michael T.
core +1 more source
Online Sorting via Searching and Selection
, 2009 In this paper, we present a framework based on a simple data structure and parameterized algorithms for the problems of finding items in an unsorted list of linearly ordered items based on their rank (selection) or value (search).
Gupta, Ankur +2 more
core +1 more source
A Novel Edge Cache-Based Private Set Intersection Protocol via Lightweight Oblivious PRF. [PDF]
Entropy (Basel), 2023 Zhang J, Yang L, Tang Y, Jin M, Wang S.
europepmc +1 more source
Cache‐oblivious matrix algorithms in the age of multicores and many cores
Concurrency and Computation: Practice and Experience, 2012 SummaryThis article highlights the issue of upcoming wider single‐instruction, multiple‐data units as well as steadily increasing core counts on contemporary and future processor architectures. We present the recent port to and latest results of cache‐oblivious algorithms and implementations of our TifaMMy code on four architectures: SGI's UltraViolet ...
Heinecke, Alexander, Trinitis, Carsten
openaire +2 more sources
TEE-Graph: efficient privacy and ownership protection for cloud-based graph spectral analysis. [PDF]
Front Big Data, 2023 Alam AKMM, Chen K.
europepmc +1 more source
Adaptive Context Caching for IoT-Based Applications: A Reinforcement Learning Approach. [PDF]
Sensors (Basel), 2023 Weerasinghe S +5 more
europepmc +1 more source
Software Grand Exposure: SGX Cache Attacks Are Practical
, 2017 Side-channel information leakage is a known limitation of SGX. Researchers have demonstrated that secret-dependent information can be extracted from enclave execution through page-fault access patterns.
Brasser, Ferdinand +5 more
core
I/O-optimal algorithms on grid graphs
, 2012 Given a graph of which the n vertices form a regular two-dimensional grid, and in which each (possibly weighted and/or directed) edge connects a vertex to one of its eight neighbours, the following can be done in O(scan(n)) I/Os, provided M = Omega(B^2):
Haverkort, Herman
core
Popularity-Aware Closeness Based Caching in NDN Edge Networks. [PDF]
Sensors (Basel), 2022 Amadeo M +3 more
europepmc +1 more source
Randomized Online Computation with High Probability Guarantees. [PDF]
Algorithmica, 2022 Komm D +3 more
europepmc +1 more source