找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Databases Theory and Applications; 27th Australasian Da Muhammad Aamir Cheema,Wenjie Zhang,Lijun Chang Conference proceedings 2016 Springer

[复制链接]
楼主: 一再
发表于 2025-3-25 07:05:12 | 显示全部楼层
发表于 2025-3-25 08:17:14 | 显示全部楼层
Analyzing EEG Signal Data for Detection of Epileptic Seizure: Introducing Weight on Visibility Graphal professionals and also for the researchers. When measuring an EEG, huge amount of data are obtained with different categories. Therefore, EEG recording can be characterized as big data due to its high volume. Traditional methods are facing challenges to handle such Big Data as it exhibits non-sta
发表于 2025-3-25 13:40:01 | 显示全部楼层
发表于 2025-3-25 19:54:20 | 显示全部楼层
Continuous Maximum Visibility Query for a Moving Targetn 3D modeling of urban environments. In this paper, we investigate the problem of continuously finding the best viewpoint from a set of candidate viewpoints that provides the best view of a moving target in presence of visual obstacles in 2D or 3D space. We propose a query type called . . query that
发表于 2025-3-25 21:11:24 | 显示全部楼层
An Index-Based Method for Efficient Maximizing Range Sum Queries in Road Networkweight sum of points covered by r is maximized. This problem has long been studied since its wide application in spatial data mining, facility locating, and clustering problems. However, most of the existing work focus on Euclidean space, which is not applicable in many real-life cases. For example,
发表于 2025-3-26 01:02:04 | 显示全部楼层
Trip Planning Queries for Subgroups in Spatial Databasesand the points of interests (POIs) from each required type (e.g., restaurant, shopping center, movie theater) that have the minimum aggregate trip distance for any subgroup size. The trip distance of a user starts at the user’s source location and ends at the user’s destination via the POIs. The com
发表于 2025-3-26 05:16:22 | 显示全部楼层
发表于 2025-3-26 09:43:18 | 显示全部楼层
Finding Least On-Road Travel Time on Road Networkquery, which aims to find a path between two vertices on a time-dependent road network that has the minimum on-road travel time(waiting on any vertex is allowed). In this paper, we propose a cheapest path algorithm which expands . to solve this problem. The time complexity of it is ., where . is the
发表于 2025-3-26 16:24:52 | 显示全部楼层
A Weighted K-AP Query Method for RSSI Based Indoor Positioningby introducing the correlation between RSSIs. The correlations can be transformed as AP fingerprint sequence to build the offline fingerprint library. To eliminate the positioning error caused by instable RSSI value, WF-SKL can filter the noise AP via online . selection, meanwhile it also reduces th
发表于 2025-3-26 18:18:47 | 显示全部楼层
Transmural Myocardial Perfusion positive or negative type, and either short-term or long-term. For each intervention, we use the temporal social network’s topology to identify candidate individuals, potentially responsible for this intervention. We use these interventions to score their influence on others. This allows us to find
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 04:51
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表