找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 一再
21#
發(fā)表于 2025-3-25 07:05:12 | 只看該作者
22#
發(fā)表于 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
23#
發(fā)表于 2025-3-25 13:40:01 | 只看該作者
24#
發(fā)表于 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
25#
發(fā)表于 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,
26#
發(fā)表于 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
27#
發(fā)表于 2025-3-26 05:16:22 | 只看該作者
28#
發(fā)表于 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
29#
發(fā)表于 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
30#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-17 03:26
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
英山县| 望城县| 璧山县| 公主岭市| 山阳县| 潢川县| 阿荣旗| 湖口县| 阿尔山市| 武平县| 凭祥市| 喀喇沁旗| 外汇| 高密市| 临夏市| 望城县| 洛扎县| 云霄县| 万州区| 共和县| 绍兴县| 洛浦县| 江阴市| 五原县| 泰来县| 万载县| 固始县| 明水县| 大城县| 息烽县| 凭祥市| 本溪市| 广平县| 九江市| 二连浩特市| 舒城县| 卓资县| 湘潭市| 酒泉市| 宝鸡市| 武陟县|