Sciweavers

123 search results - page 5 / 25
» Efficient B-tree Based Indexing for Cloud Data Processing
Sort
View
GIS
2010
ACM
13 years 5 months ago
Cleaning massive sonar point clouds
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
Lars Arge, Kasper Green Larsen, Thomas Mølh...
WISE
2006
Springer
14 years 1 months ago
Efficient Filtering Query Indexing in Data Stream
Filtering queries are widely used in data stream applications. As more and more filtering queries are registered in high-speed data stream management system, the processing efficie...
Ying Wang, Shuo Bai, Jianlong Tan, Li Guo
DATESO
2009
119views Database» more  DATESO 2009»
13 years 5 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
CVPR
2009
IEEE
15 years 2 months ago
From Structure-from-Motion Point Clouds to Fast Location Recognition
Efficient view registration with respect to a given 3D reconstruction has many applications like inside-out tracking in indoor and outdoor environments, and geo-locating images ...
Arnold Irschara (Graz University of Technology), C...
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 8 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...