External memory algorithms and data structures: Dealing with massive data
JS Vitter - ACM Computing surveys (CsUR), 2001 - dl.acm.org
Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …
internal memory. The resulting input/output communication (or I/O) between fast internal …
[BOOK][B] Algorithms and data structures: The basic toolbox
K Mehlhorn, P Sanders, P Sanders - 2008 - Springer
Algorithms are at the heart of every nontrivial computer application, and algorithmics is a
modern and active area of computer science. Every computer scientist and every …
modern and active area of computer science. Every computer scientist and every …
[BOOK][B] Handbook of data structures and applications
Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …
until now there was no book that focused exclusively on the wide variety of data structures …
Continuous monitoring of distance-based outliers over data streams
M Kontaki, A Gounaris… - 2011 IEEE 27th …, 2011 - ieeexplore.ieee.org
Anomaly detection is considered an important data mining task, aiming at the discovery of
elements (also known as outliers) that show significant diversion from the expected case …
elements (also known as outliers) that show significant diversion from the expected case …
Algorithms and data structures for external memory
JS Vitter - … and Trends® in Theoretical Computer Science, 2008 - nowpublishers.com
Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …
internal memory. The resulting input/output communication (or I/O) between fast internal …
[BOOK][B] Sequential and Parallel Algorithms and Data Structures
viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …
proportional performance improvements from increased circuit complexity. Although the …
The buffer tree: A technique for designing batched external data structures
L Arge - Algorithmica, 2003 - Springer
We present a technique for designing external memory data structures that support batched
operations I/O efficiently. We show how the technique can be used to develop external …
operations I/O efficiently. We show how the technique can be used to develop external …
A functional approach to external graph algorithms
Abello, Buchsbaum, Westbrook - Algorithmica, 2002 - Springer
We present a new approach for designing external graph algorithms and use it to design
simple, deterministic and randomized external algorithms for computing connected …
simple, deterministic and randomized external algorithms for computing connected …
Efficient and flexible algorithms for monitoring distance-based outliers over data streams
Anomaly detection is considered an important data mining task, aiming at the discovery of
elements (known as outliers) that show significant diversion from the expected case. More …
elements (known as outliers) that show significant diversion from the expected case. More …
SparseProp: efficient event-based simulation and training of sparse recurrent spiking neural networks
R Engelken - Advances in Neural Information Processing …, 2024 - proceedings.neurips.cc
Abstract Spiking Neural Networks (SNNs) are biologically-inspired models that are capable
of processing information in streams of action potentials. However, simulating and training …
of processing information in streams of action potentials. However, simulating and training …