Location-dependent query processing: Where we are and where we are heading
The continuous development of wireless networks and mobile devices has motivated an
intense research in mobile data services. Some of these services provide the user with …
intense research in mobile data services. Some of these services provide the user with …
Continuous spatial query processing: A survey of safe region based techniques
In the past decade, positioning system-enabled devices such as smartphones have become
most prevalent. This functionality brings the increasing popularity of location-based services …
most prevalent. This functionality brings the increasing popularity of location-based services …
Continuous nearest neighbor monitoring in road networks
Recent research has focused on continuous monitoring of nearest neighbors (NN) in highly
dynamic scenarios, where the queries and the data objects move frequently and arbitrarily …
dynamic scenarios, where the queries and the data objects move frequently and arbitrarily …
Top-k monitoring in wireless sensor networks
Top-k monitoring is important to many wireless sensor applications. This paper exploits the
semantics of top-k query and proposes an energy-efficient monitoring approach called FILA …
semantics of top-k query and proposes an energy-efficient monitoring approach called FILA …
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbors
queries in Euclidean space as well as in spatial networks. Existing techniques are sensitive …
queries in Euclidean space as well as in spatial networks. Existing techniques are sensitive …
Continuous monitoring of distance-based range queries
Given a positive value r, a distance-based range query returns the objects that lie within the
distance r of the query location. In this paper, we focus on the distance-based range queries …
distance r of the query location. In this paper, we focus on the distance-based range queries …
Closest pairs search over data stream
k-closest pair (KCP for short) search is a fundamental problem in database research. Given
a set of d-dimensional streaming data S, KCP search aims to retrieve k pairs with the …
a set of d-dimensional streaming data S, KCP search aims to retrieve k pairs with the …
Fall detection for industrial setups using yolov8 variants
GA Pereira - arxiv preprint arxiv:2408.04605, 2024 - arxiv.org
This paper presents the development of an industrial fall detection system utilizing YOLOv8
variants, enhanced by our proposed augmentation pipeline to increase dataset variance …
variants, enhanced by our proposed augmentation pipeline to increase dataset variance …
Efficient proximity and separation detection among mobile targets for supporting location-based community services
Proximity and separation detection are high-level functions for supporting proactive location-
based community services. Proximity detection automatically triggers an alert as soon as a …
based community services. Proximity detection automatically triggers an alert as soon as a …
Continuous top-k dominating queries
M Kontaki, AN Papadopoulos… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
Top-k dominating queries use an intuitive scoring function which ranks multidimensional
points with respect to their dominance power, ie, the number of points that a point …
points with respect to their dominance power, ie, the number of points that a point …