the proceedings contain 56 papers. the topics discussed include: orthogonal range searching in linear and almost-linear space;spherical LSH for approximate nearest neighbor search on unit hypersphere;approximating the...
详细信息
ISBN:
(纸本)3540739483
the proceedings contain 56 papers. the topics discussed include: orthogonal range searching in linear and almost-linear space;spherical LSH for approximate nearest neighbor search on unit hypersphere;approximating the maximum sharing problem;edges and switches, tunnels and bridges;drawing colored graphs on colored points;priority queues resilient to memory faults;simple and space-efficient minimal perfect hash functions;approximate algorithms for the sex-equal stable marriage problem;flooding countries and destroying dams;on a family of strong geometric spanners that admit local routing strategies;spanners for geometric intersection graphs;on generalized diamond spanners;improved results for a memory allocation problem;kernelization and complexity results for connectivity augmentation problems;and optimal lightweight construction of suffix arrays for constant alphabets.
Fake news and disinformation recognition has become a very important and simultaneously hot problem in our current life. this problem touches different countries and in consequence different national languages and sta...
详细信息
Deep learning (DL) has emerged as a crucial tool in network anomaly detection (NAD) for cybersecurity. While DL models for anomaly detection excel at extracting features and learning patterns from data, they are vulne...
详细信息
Blockchain technology has significantly transformed various industries by enabling secure and tamper-resistant transactions. However, the rise of quantum computing threatens the cryptographic foundations of blockchain...
详细信息
In the era of data protection regulations like GDPR, safeguarding sensitive information has become paramount, prompting the exploration of synthetic data generation as a privacy-preserving alternative. Generative Adve...
详细信息
Imprecision of input data is one of the main obstacles that prevent geometric algorithms from being used in practice. We model an imprecise point by a region in which the point must lie. Given a set of imprecise point...
详细信息
Imprecision of input data is one of the main obstacles that prevent geometric algorithms from being used in practice. We model an imprecise point by a region in which the point must lie. Given a set of imprecise points, we study Computing the largest and smallest possible values of various basic geometric measures on point sets, such as the diameter, width, closest pair, smallest enclosing circle, and smallest enclosing bounding box. We give efficient algorithms for most of these problems, and identify the hardness of others. (C) 2009 Elsevier B.V. All rights reserved.
We report on a new course Verified Functional datastructures and algorithms taught at the Technical University of Munich. the course first introduces students to interactive theorem proving withthe Isabelle proof as...
详细信息
ISBN:
(纸本)9781450382991
We report on a new course Verified Functional datastructures and algorithms taught at the Technical University of Munich. the course first introduces students to interactive theorem proving withthe Isabelle proof assistant. then it covers a range of standard datastructures, in particular search trees and priority queues: it is shown how to express these datastructures functionally and how to reason about their correctness and running time in Isabelle.
We study the straggler identification problem, in which an algorithm must determine the identities of the remaining members of a set after it has had a large number of insertion and deletion operations performed on it...
详细信息
ISBN:
(纸本)9783540739487
We study the straggler identification problem, in which an algorithm must determine the identities of the remaining members of a set after it has had a large number of insertion and deletion operations performed on it, and now has relatively few remaining members.
暂无评论