Results 51 to 60 of about 37,551,526 (314)
Optimal Las Vegas Locality Sensitive Data Structures
, 2017 We show that approximate similarity (near neighbour) search can be solved in high dimensions with performance matching state of the art (data independent) Locality Sensitive Hashing, but with a guarantee of no false negatives. Specifically, we give two
Ahle, Thomas Dybdahl
core +1 more source
Building Efficient and Compact Data Structures for Simplicial Complexes [PDF]
, 2016 The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes.
Boissonnat, Jean-Daniel +2 more
core +4 more sources
Moving in the Dark: Enlightening the Spatial Population Ecology of European Cave Salamanders
Population Ecology, EarlyView.We assessed individual interactions, movement ecology and activity patterns of a subterranean population of Speleomantes strinatii, applying spatial capture–recapture modeling to a photographic dataset of 104 individuals. ABSTRACT Space use and movement are fundamental aspects of organisms' ecology, mirroring individual fitness, behavior, and life ...
Giacomo Rosa +2 more
wiley +1 more source
YARS-PG: Property Graphs Representation for Publication and Exchange
IEEE AccessGraph serialization is a critical aspect of advancing graph-oriented systems and applications. Despite the importance of standardized serialization for property graphs, there is a lack of a universal format encompassing all essential features of graph ...
Lukasz Szeremeta +2 more
doaj +1 more source
Data Structures and Data Types in Object-Oriented Databases [PDF]
, 1991 The possibility of finding a static type system for object-oriented programming languages was initiated by Cardelli [Car88, CW85] who showed that it is possible to express the polymorphic nature of functions such ...
Breazu-Tannen, Val +2 more
core
Data Structures for Task-based Priority Scheduling
, 2013 Many task-parallel applications can benefit from attempting to execute tasks in a specific order, as for instance indicated by priorities associated with the tasks.
Cederman, Daniel +4 more
core +1 more source
FoxO1 signaling in B cell malignancies and its therapeutic targeting
FEBS Letters, EarlyView.FoxO1 has context‐specific tumor suppressor or oncogenic character in myeloid and B cell malignancies. This includes tumor‐promoting properties such as stemness maintenance and DNA damage tolerance in acute leukemias, or regulation of cell proliferation and survival, or migration in mature B cell malignancies.
Krystof Hlavac +3 more
wiley +1 more source
, 1989 We discuss data structures and their methods of analysis. In particular, we treat the unweighted and weighted dictionary problem, self-organizing data structures, persistent data structures, the union-find-split problem, priority queues, the nearest ...
Mehlhorn, Kurt, Tsakalidis, A.
core +1 more source
REWIND: Recovery Write-Ahead System for In-Memory Non-Volatile Data-Structures
Proceedings of the VLDB Endowment, 2015 Recent non-volatile memory (NVM) technologies, such as PCM, STT-MRAM and ReRAM, can act as both main memory and storage. This has led to research into NVM programming models, where persistent data structures remain in memory and are accessed directly ...
Andreas Chatzistergiou +2 more
semanticscholar +1 more source
Making tau amyloid models in vitro: a crucial and underestimated challenge
FEBS Letters, EarlyView.This review highlights the challenges of producing in vitro amyloid assemblies of the tau protein. We review how accurately the existing protocols mimic tau deposits found in the brain of patients affected with tauopathies. We discuss the important properties that should be considered when forming amyloids and the benchmarks that should be used to ...
Julien Broc, Clara Piersson, Yann Fichou
wiley +1 more source