Sciweavers

45 search results - page 2 / 9
» Probabilistic Nearest-Neighbor Query on Uncertain Objects
Sort
View
PVLDB
2010
152views more  PVLDB 2010»
13 years 3 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
PVLDB
2008
146views more  PVLDB 2008»
13 years 4 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
EDBT
2009
ACM
174views Database» more  EDBT 2009»
14 years 1 days ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...
TKDE
2010
185views more  TKDE 2010»
13 years 3 months ago
Superseding Nearest Neighbor Search on Uncertain Spatial Databases
This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability den...
Sze Man Yuen, Yufei Tao, Xiaokui Xiao, Jian Pei, D...
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