检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Zhi Yu Can Wang Jiajun Bu Mengni Zhang Zejun Wu Chun Chen
出 处:《国际计算机前沿大会会议论文集》2015年第1期138-139,共2页International Conference of Pioneering Computer Scientists, Engineers and Educators(ICPCSEE)
摘 要:Many people would like to purchase items using locationbased services to find the suitable stores in daily life. Although there are many online map search engines giving isolated Point-of-Interest as query results according to the correlation between isolated stores and the query, this interaction is difficult in meeting the shopping needs of people with disabilities, who would usually prefer shopping in one single location to avoid inconvenience in transportation. In this article, we propose a framework of map search service using Region-of-Interest (ROI) as the query result, which can greatly reduce users shopping distance among multiple stores. High order Voronoi diagram is used to reduce the time complexity of Region-of-Interests generation. Experimental results show that our method is both efficient and effective.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.36