位置：成果数据库 > 会议 > 会议详情页
Top-K Probabilistic Closest Pairs Query in Uncertain Spatial Databases
  • 所属机构名称：东北大学
  • 会议名称：13th Asia-Pacific Conference on Web Technology
  • 时间：2011
  • 成果类型：会议
  • 相关项目：物联网空间内基于位置服务的数据管理技术研究
作者： Chen, Mo|Jia, Zixi|Gu, Yu|Yu, Ge|
同会议论文项目
物联网空间内基于位置服务的数据管理技术研究
期刊论文 28 会议论文 12 专利 1
同项目会议论文
Adaptive update workload reduction for moving objects in road networks
Differentially private histogram publication
EUDEMON: A System for Online Video Frame Copy Detection by Earth Mover’s Distance
Shortest Path Computation over Disk-resident Large Graphs based on Extended Bulk Synchronous Paralle
Parallel Triangle Counting over Large Graphs
Evaluating Probabilistic Spatial-Range Closest. Pairs Queries over Uncertain Objects
Scalable complex event processing on top of MapReduce
MRQSim: A Moving Range Query Simulation Platform in Spatial Networks
wNeighbors: A Method for Finding k Nearest Neighbors in Weighted Regions
Optimal k - constraint coverage queries on spatial objects
Interval reverse nearest neighbor queries on uncertain data with Markov correlations