In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Existing techniques for autonomous indoor navigation are often environment-specific and thus limited in terms of their applicability. In this paper, we take a fundamentally differ...
We present a technique for creating a digital elevation model (DEM) from grid-based contour data. The method computes new, intermediate contours in between existing isolines. Thes...