位置：成果数据库 > 会议 > 会议详情页
Efficient Evaluation of Probabilistic Visible k Nearest Neighbor Queries
  • 所属机构名称：东北大学
  • 会议名称：The First International Conference on Emerging Databases (EDB 2009)
  • 成果类型：会议
  • 相关项目：面向RFID复杂应用的事件流处理技术的研究
作者： Mo Chen|Ge Yu|Yu Gu|Chuanfei Xu|Yanqiu Wang|
同会议论文项目
面向RFID复杂应用的事件流处理技术的研究
期刊论文 23 会议论文 22
同项目会议论文
Complex Event Detection in Probabilistic Stream
Processing Constrained Group Nearest Group Queries
Valid Interval: An Effective Technique for Continuous Range Query in Spatial Networks
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
MRQSim: A Moving Range Query Simulation Platform in Spatial Networks
wNeighbors: A Method for Finding k Nearest Neighbors in Weighted Regions
Modeling and service capability evaluation for RFID complex event processing
New schedulability test conditions for non-preemptive scheduling on multiprocessor platforms
Moving k-nearest neighbor query over obstructed regions
Efficient similarity query in RFID trajectory databases
Efficient RFID data imputation by analyzing the correlations of monitored objects
New response time bounds for fixed priority multiprocessor scheduling
Research on event prediction algorithm based on event sequence semantic
Pk-Period: A Probabilistic Periodic Analysis Approach over Uncertain Time Series
Efficient Fuzzy Top-k Query Processing over Uncertain Object
An Efficient Dirty-Event Cleaning Technology over Uncertain Data in WSNs
Probabilistic moving range query over RFID spatio-temporal data streams
Effective similarity analysis over event streams based on sharing extent
Adaptive correlation analysis in stream time series with sliding windows
A query processing approach based on queuing model for cyber-physical systems