Results 31 to 40 of about 42,688,929 (320)
Probabilistic Data Structures in Adversarial Environments
Conference on Computer and Communications Security, 2019 Probabilistic data structures use space-efficient representations of data in order to (approximately) respond to queries about the data. Traditionally, these structures are accompanied by probabilistic bounds on query-response errors.
David Clayton +2 more
semanticscholar +1 more source
Partially complemented representations of digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 Special issue: Graph ...
Elias Dahlhaus +2 more
doaj +1 more source
Partially persistent search trees with transcript operations [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 When dictionaries are persistent, it is natural to introduce a transcript operation which reports the status changes for a given key over time. We discuss when and how a time and space efficient implementation of this operation can be provided.
Kim S. Larsen
doaj +1 more source
Applied Statistics, 1971 In most computer languages, the data are regarded as being held in machine storage either as individual scalar quantities or as members of rectangular arrays. It would make these languages more useful if the user were allowed to specify the shapes of other structures in which he wished to consider the data as being held, such as triangular arrays ...
Gower, J. C., Hill, I. D.
openaire +1 more source
Sketching and Sublinear Data Structures in Genomics
Annual Review of Biomedical Data Science, 2019 Large-scale genomics demands computational methods that scale sublinearly with the growth of data. We review several data structures and sketching techniques that have been used in genomic analysis methods.
G. Marçais +3 more
semanticscholar +1 more source
, 2010 We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data types are specified using relational algebra and functional dependencies; a novel fuse operation on relational indexes specifies where the underlying physical data structure
Hawkins, Peter +4 more
openaire +2 more sources
Optimising Simulation Data Structures for the Xeon Phi [PDF]
, 2016 In this paper, we propose a lock-free architecture to accelerate logic gate circuit simulation using SIMD multi-core machines. We evaluate its performance on different test circuits simulated on the Intel Xeon Phi and 2 other machines.
Chimeh, Mozhgan K., Cockshott, Paul
core +1 more source
Lightweight Dual-Attention Network for Concrete Crack Segmentation
SensorsStructural health monitoring in resource-constrained environments demands crack segmentation models that match the accuracy of heavyweight convolutional networks while conforming to the power, memory, and latency limits of watt-level edge devices.
Min Feng, Juncai Xu
doaj +1 more source
Data Autodiscovery—The Role of the OPD
ISPRS International Journal of Geo-Information, 2016 The importance of open data and the benefits it can offer have received recognition on the international stage with the signing of the G8 Open Data Charter in June 2013.
Adrian J. M. Cox +2 more
doaj +1 more source
ALGORITHMS AND DATA STRUCTURE LIBRARIES FOR JAVA [PDF]
Acta Electrotechnica et Informatica, 2020 This paper is dedicated to the comparison of different libraries of algorithms and data structures for the Java language. Within the paper currently available and relevant libraries are analyzed and compared.
Patrik PERHAC, Slavomir SIMONAK
doaj +1 more source