Browsing by Subject "Data structures"
Now showing items 1-12 of 12
-
Deep Learning Models for Yoga Pose Monitoring
(2022)Activity recognition is the process of continuously monitoring a person’s activity and movement. Human posture recognition can be utilized to assemble a self-guidance practice framework that permits individuals to accurately ... -
Dose calculation optimization in intracranial stereotactic radiotherapy using implicit surface modeling
(2009)Intracranial Stereotactic radiotherapy / radiosurgery utilize fractioned dose delivery through multiple noncoplanar arcs to avoid harm of normal tissue. Proper positioning of the arcs in respect to avoid Organs at Risk ... -
Grid-file: Towards to a flash efficient multi-dimensional index
(2015)Spatial indexes are of great importance for multidimensional query processing. Traditional data structures have been optimized for magnetic disks in the storage layer. In the recent years flash solid disks are widely ... -
An integer programming approach for frequent itemset hiding
(2006)The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive knowledge from being exposed in patterns ... -
Investigating the replica transfer scheduling problem
(2006)The Replica Placement Problem (RPP) aims at selecting the nodes for duplicating data objects in order to optimize their access. Even though a lot of work already exists on RPP, the issue of implementing the resulting ... -
Merging R-trees
(2004)R-trees, since their introduction in 1984, have been proven to be one of the most well-behaved practical data structures for accommodating dynamic massive sets of geometric objects and conducting a diverse set of queries ... -
Optically-Enabled Bloom Filter Label Forwarding Using a Silicon Photonic Switching Matrix
(2017)Simplified forwarding schemes relying on Bloom filter (BF)-based labels emerge as a promising approach for coping with the substantial increase in lookup table memory requirements associated with the growing number of ... -
Positional data organization and compression in web inverted indexes
(2012)To sustain the tremendous workloads they suffer on a daily basis, Web search engines employ highly compressed data structures known as inverted indexes. Previous works demonstrated that organizing the inverted lists of the ... -
Predictive join processing between regions and moving objects
(2008)The family of R-trees is suitable for indexing various kinds of multidimensional objects. TPR*-trees are R-tree based structures that have been proposed for indexing a moving object database, e.g. a data-base of moving ... -
A Proactive Statistical Model Supporting Services and Tasks Management in Pervasive Applications
(2022)The combination of the Internet of Things (IoT) and Edge Computing (EC) can support intelligent pervasive applications that meet the needs of end users. A challenge is to provide efficient inference models for supporting ... -
A programmable Si-photonic node for SDN-enabled Bloom filter forwarding in disaggregated data centers
(2017)Programmable switching nodes supporting Software-Defined Networking (SDN) over optical interconnecting technologies arise as a key enabling technology for future disaggregated Data Center (DC) environments. The SDNenabling ... -
A quantitative and qualitative analysis of blocking in association rule hiding
(2004)Data mining provides the opportunity to extract useful information from large databases. Various techniques have been proposed in this context in order to extract this information in the most efficient way. However, ...