Sciweavers

14 search results - page 1 / 3
» Finding Probabilistic Nearest Neighbors for Query Objects wi...
Sort
View
MDM
2009
Springer
116views Communications» more  MDM 2009»
13 years 11 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
13 years 11 months ago
Probabilistic Granule-Based Inside and Nearest Neighbor Queries
The development of location-based services and advances in the field of mobile computing have motivated an intensive research effort devoted to the efficient processing of locati...
Sergio Ilarri, Antonio Corral, Carlos Bobed, Eduar...
MDM
2010
Springer
152views Communications» more  MDM 2010»
13 years 9 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
13 years 11 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 6 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen