Reverse nearest neighbor queries are defined as follows: Given an input point-set P , and a query point q, find all the points p in P whose nearest point in P ∪ {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O(log n).

We investigate statistical dependency parsing of two closely related languages, Croatian and Serbian. As these two morphologically complex languages of relaxed word order are generally under-resourced – with the topic of dependency parsing still largely unaddressed, especially for Serbian – we make use of the two available dependency treebanks of Croatian to produce state-of-the-art parsing mod...

Interpreting remotely sensed data typically requires expensive specialized computing machinery capable of stor ing and manipulating large amounts of data quickly In this paper we present a method for accurately analyzing and categorizing remotely sensed data on much smaller less expensive platforms Data size is reduced in such a way as to retain the integrity of the original data where the form...

The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in [36] that provides a unifying analysis of a wide class of hub location models. In this paper, we deal with the capacitated version of this problem, presenting two formulations as well as some preprocessing phases for fixing variables. In addition, a strengthening of one of these formulations is also st...

People often conduct preprocessing to simplify primary processing. Usually, there is a trade-off between the costs of performing preprocessing and primary processing. Therefore, the utility of preprocessing differs depending on the task complexity. We conducted three experiments to find out whether people could adaptively estimate the utility of preprocessing and then take rational action. The ...

We study space/time tradeoffs for querying some combinatorial structures. In the first, given an arrangement of n lines in general position in the plane, a query for a real number t asks about Rank(t), the number of vertices of the arrangement with x-coordinates ≤ t. We show that for K = O(n/logn), after a preprocessing step that uses space S = O(n/(K logK)) the query can be answered in time O(...

This paper presents the participation of the RU-DS team at the MediaEval 2017 Multimedia Satellite Task. We design a system for retrieving social images that show direct evidence of flooding events using a multimodal approach based on visual features from images and the corresponding metadata. Specifically, we implement preprocessing operations including image cropping and test-set pre-filterin...

We analyze how to efficiently maintain and update the visibility polygons for a segment observer moving in a polygonal domain. The space and time requirements for preprocessing are O(n) and after preprocessing, visibility change events for weak and strong visibility can be handled in O(log |VP|) and O(log(|VP1| + |VP2|)) respectively, or O(log n) in which |VP| is the size of the line segment’s ...

In this contribution a practical approach to determine and store position dependent parameters is presented. These parameters can be obtained, among others, using experimental results or expert knowledge and are stored in ’Information Maps’. Each Information Map can be interpreted as a kind of static grid map and the framework allows to link different maps hierarchically. The Information Maps c...