Results 121 to 130 of about 37,788,190 (381)
Lock-free Concurrent Data Structures
Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the program to access and manipulate these data.
Cederman, Daniel+5 more
core
Building ontologies from folksonomies and linked data: Data structures and Algorithms [PDF]
We present the data structures and algorithms used in the approach for building domain ontologies from folksonomies and linked data. In this approach we extracts domain terms from folksonomies and enrich them with semantic information from the Linked ...
Corcho, Oscar+4 more
core +1 more source
Efficient data structures for masks on 2D grids
This article discusses various methods of representing and manipulating arbitrary coverage information in two dimensions, with a focus on space- and time-efficiency when processing such coverages, storing them on disk, and transmitting them between ...
Hivon, Eric, Reinecke, Martin
core +2 more sources
Circulating tumor cells: advancing personalized therapy in small cell lung cancer patients
Small cell lung cancer (SCLC) is an aggressive form of lung cancer that spreads rapidly to secondary sites such as the brain and liver. Cancer cells circulating in the blood, “circulating tumor cells” (CTCs), have demonstrated prognostic value in SCLC, and evaluating biomarkers on CTCs could guide treatment decisions such as for PARP inhibitors ...
Prajwol Shrestha+6 more
wiley +1 more source
Predicting the impact of public events and mobility in Smart Cities
The ubiquitous presence of smartphones and the ever‐expanding Internet of Things are generating a treasure trove of data on human movement. We harness the power of Artificial Intelligence to extract knowledge within this data, in particular for ...
Elena Bellodi+4 more
doaj +1 more source
Every Data Structure Deserves Lock-Free Memory Reclamation [PDF]
Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cases, requires redesigning the data structure.
arxiv
Path Query Data Structures in Practice [PDF]
We perform experimental studies on data structures that answer path median, path counting, and path reporting queries in weighted trees. These query problems generalize the well-known range median query problem in arrays, as well as the $2d$ orthogonal range counting and reporting problems in planar point sets, to tree structured data.
arxiv
Cell‐free and extracellular vesicle microRNAs with clinical utility for solid tumors
Cell‐free microRNAs (cfmiRs) are small‐RNA circulating molecules detectable in almost all body biofluids. Innovative technologies have improved the application of cfmiRs to oncology, with a focus on clinical needs for different solid tumors, but with emphasis on diagnosis, prognosis, cancer recurrence, as well as treatment monitoring.
Yoshinori Hayashi+6 more
wiley +1 more source
Tourism represents a crucial socio‐economic pillar globally, yet the multifaceted challenges it poses necessitate innovative management approaches. The paradigm of smart tourism harnesses advanced data analytics tools to promote both profitability and ...
José Ginés Giménez Manuel+5 more
doaj +1 more source
There is an increasing need for building models that permit interior navigation, e.g., for escape route analysis. This paper presents a non-manifold Computer-Aided Design (CAD) data structure, the dual half-edge based on the Poincaré duality that ...
Pawel Boguslawski, Christopher Gold
doaj +1 more source