Results 31 to 40 of about 737,146 (331)
Counting With Tinytable: Every Bit Counts!
IEEE Access, 2019 Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality, such as removals or counting.
Gil Einziger, Roy Friedman
doaj +1 more source
Time varying VARs with inequality restrictions [PDF]
, 2008 In many applications involving time-varying parameter VARs, it is desirable to restrict the VAR coe¢ cients at each point in time to be non-explosive. This is an example of a problem where inequality restrictions are imposed on states in a state space ...
Koop, Gary, Potter, Simon
core
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Cyclophosphamide (CY) is associated with potentially fatal cardiotoxicity, yet no electrocardiographic indices have been established for early detection of CY‐induced cardiomyopathy. This study aimed to determine whether corrected QT interval (QTc) prolongation can predict early onset of CY‐related cardiac dysfunction in pediatric ...
Junpei Kawamura +5 more
wiley +1 more source
Two Approaches to Constructing Certified Dominating Sets in Social Networks
IEEE AccessSocial networks are an important part of our community. In this context, certified dominating sets help to find in networks a group of people, referring as officials, such that 1) for each civilian, there is an official that can serve the civilian, and 2)
Joanna Raczek, Mateusz Miotk
doaj +1 more source
Two-Layer Network Caching for Different Service Requirements
Future Internet, 2021 Network caching is a technique used to speed-up user access to frequently requested contents in complex data networks. This paper presents a two-layer overlay network caching system for content distribution.
Gianluca Reali, Mauro Femminella
doaj +1 more source
Improved Approximation Algorithms for Relay Placement
, 2015 In the relay placement problem the input is a set of sensors and a number $r \ge 1$, the communication range of a relay. In the one-tier version of the problem the objective is to place a minimum number of relays so that between every pair of sensors ...
Efrat, Alon +4 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objectives To identify predictors of chronic ITP (cITP) and to develop a model based on several machine learning (ML) methods to estimate the individual risk of chronicity at the timepoint of diagnosis. Methods We analyzed a longitudinal cohort of 944 children enrolled in the Intercontinental Cooperative immune thrombocytopenia (ITP) Study ...
Severin Kasser +6 more
wiley +1 more source
Bamboo Garden Trimming Problem: Priority Schedulings
Algorithms, 2019 The paper deals with the Bamboo Garden Trimming (BGT) problem introduced in [Gąsieniec et al., SOFSEM’17]. The problem is difficult to solved due to its close relationship to Pinwheel scheduling. The garden with n bamboos is an analogue of a system
Mattia D’Emidio +2 more
doaj +1 more source
Reachability in Biochemical Dynamical Systems by Quantitative Discrete Approximation (extended abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 In this paper, a novel computational technique for finite discrete approximation of continuous dynamical systems suitable for a significant class of biochemical dynamical systems is introduced.
L. Brim +3 more
doaj +1 more source
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems
Algorithms, 2022 Motivated by applications in ride-sharing and truck-delivery, we study the problem of matching a number of requests and assigning them to cars. A number of cars are given, each of which consists of a location and a speed, and a number of requests are ...
Kelin Luo, Frits C. R. Spieksma
doaj +1 more source