Sciweavers

237 search results - page 4 / 48
» Methods for Achieving Fast Query Times in Point Location Dat...
Sort
View
GEOINFORMATICA
2006
133views more  GEOINFORMATICA 2006»
13 years 7 months ago
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has bec...
Dan Lin, Rui Zhang 0003, Aoying Zhou
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 1 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi
CVPR
2007
IEEE
14 years 1 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
GCB
2004
Springer
91views Biometrics» more  GCB 2004»
14 years 12 days ago
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
Hanjo Täubig, Arno Buchner, Jan Griebsch
ICDT
2011
ACM
232views Database» more  ICDT 2011»
12 years 10 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...