Results 51 to 60 of about 6,963,647 (337)
, 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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction We developed MedSupport, a multilevel medication adherence intervention designed to address root barriers to medication adherence. This study sought to explore the feasibility and acceptability of the MedSupport intervention strategies to support a future full‐scale randomized controlled trial.
Elizabeth G. Bouchard +8 more
wiley +1 more source
Succinct data structures for representing equivalence classes
, 2013 Given a partition of an n element set into equivalence classes, we consider time-space tradeoffs for representing it to support the query that asks whether two given elements are in the same equivalence class.
Lewenstein, Moshe +2 more
core +1 more source
Deterministic sub-linear space LCE data structures with efficient construction [PDF]
, 2016 Given a string $S$ of $n$ symbols, a longest common extension query $\mathsf{LCE}(i,j)$ asks for the length of the longest common prefix of the $i$th and $j$th suffixes of $S$. LCE queries have several important applications in string processing, perhaps
Bannai, Hideo +5 more
core +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background/Objectives Osteosarcoma is a radioresistant tumor that may benefit from stereotactic body radiation therapy (SBRT) for locoregional control in metastatic/recurrent disease. We report institutional practice patterns, outcomes, toxicity, and failures in osteosarcoma patients treated with SBRT.
Jenna Kocsis +13 more
wiley +1 more source
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
Lifestyle Behaviors and Cardiotoxic Treatment Risks in Adult Childhood Cancer Survivors
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Higher doses of anthracyclines and heart‐relevant radiotherapy increase cardiovascular disease (CVD) risk. This study assessed CVD and CVD risk factors among adult childhood cancer survivors (CCSs) across cardiotoxic treatment risk groups and examined associations between lifestyle behaviors and treatment risks.
Ruijie Li +6 more
wiley +1 more source
Data structures for retrieval on integer grids [PDF]
, 1984 A family of data structures is presented for retrieval of the sum of values of points within a half-plane or polygon, given that the points are on integer coordinates in the plane.
Katz, Martin David, Volper, Dennis J.
core +1 more source
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
Dynamic Range Majority Data Structures [PDF]
, 2011 Given a set $P$ of coloured points on the real line, we study the problem of answering range $\alpha$-majority (or "heavy hitter") queries on $P$. More specifically, for a query range $Q$, we want to return each colour that is assigned to more than an ...
A. Andersson +12 more
core +1 more source