Sciweavers

505 search results - page 51 / 101
» Approximate databases: a support tool for approximate reason...
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
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...
Jonathan A. Kelner, Evdokia Nikolova
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
11 years 10 months ago
Processing and Notifying Range Top-k Subscriptions
— 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...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
GIS
2007
ACM
14 years 9 months ago
Proximity queries in large traffic networks
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 ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
GIS
2008
ACM
14 years 9 months ago
Autonomous navigation of mobile agents using RFID-enabled space partitions
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...
Muhammad Atif Mehmood, Lars Kulik, Egemen Tanin
GIS
2003
ACM
14 years 8 months ago
Constructing a dem from grid-based data by computing intermediate contours
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...
Michael B. Gousie, Wm. Randolph Franklin