標(biāo)題: Titlebook: Advances in Spatial and Temporal Databases; 10th International S Dimitris Papadias,Donghui Zhang,George Kollios Conference proceedings 2007 [打印本頁] 作者: 固執(zhí)已見 時(shí)間: 2025-3-21 18:29
書目名稱Advances in Spatial and Temporal Databases影響因子(影響力)
書目名稱Advances in Spatial and Temporal Databases影響因子(影響力)學(xué)科排名
書目名稱Advances in Spatial and Temporal Databases網(wǎng)絡(luò)公開度
書目名稱Advances in Spatial and Temporal Databases網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Spatial and Temporal Databases被引頻次
書目名稱Advances in Spatial and Temporal Databases被引頻次學(xué)科排名
書目名稱Advances in Spatial and Temporal Databases年度引用
書目名稱Advances in Spatial and Temporal Databases年度引用學(xué)科排名
書目名稱Advances in Spatial and Temporal Databases讀者反饋
書目名稱Advances in Spatial and Temporal Databases讀者反饋學(xué)科排名
作者: Embolic-Stroke 時(shí)間: 2025-3-21 22:40 作者: MURKY 時(shí)間: 2025-3-22 02:22 作者: AGGER 時(shí)間: 2025-3-22 08:32
Kim Youwang,Kim Ji-Yeon,Tae-Hyun Ohore 3D data sets. Particularly in the field of . (CFD), the rapidly increasing size of data sets with complex geometric and supplementary scalar information requires new out-of-core solutions for fast isosurface extraction and other CFD post-processing tasks. Whereas spatial access methods overcome 作者: 不能和解 時(shí)間: 2025-3-22 11:44
Qingpei Guo,Kaisheng Yao,Wei Chu containing complex objects and defining costly distance functions on spatial, temporal and multimedia data. Rather, the use of an adequate multi-step query processing strategy is crucial for the performance of a similarity search routine that deals with complex distance functions. Reducing the numb作者: Synchronism 時(shí)間: 2025-3-22 16:20 作者: Trochlea 時(shí)間: 2025-3-22 17:18 作者: Lament 時(shí)間: 2025-3-22 23:52 作者: adumbrate 時(shí)間: 2025-3-23 03:22 作者: LARK 時(shí)間: 2025-3-23 05:58
Hao Lu,Wenze Liu,Hongtao Fu,Zhiguo Caoise spatial data type for . for use in spatial systems. In this paper, we consider a subclass of map geometries known as . that are able to model maps containing region features. However, spatial partitions are defined using concepts such as infinite point sets that cannot be directly represented in作者: concert 時(shí)間: 2025-3-23 13:09
Panoptic Scene Graph Generation,them. In this paper we define a geographic ontology reference model and, from it, the set of heterogeneities that may occur when comparing two geographic ontologies is elaborated, at both the concept and instance-level. Based on the heterogeneities set we then present the ., which consists in a soft作者: CHOKE 時(shí)間: 2025-3-23 14:40
Hao Lu,Wenze Liu,Hongtao Fu,Zhiguo Caoships are qualitative and respond to questions about the relative positions (e.g., disjointedness or containment) of spatial objects. Several models have been proposed that effectively define formal sets of topological relationships between . spatial data types. The generalization of topological rel作者: insidious 時(shí)間: 2025-3-23 18:36 作者: 核心 時(shí)間: 2025-3-24 00:37 作者: 無政府主義者 時(shí)間: 2025-3-24 03:13
Hanbin Hong,Binghui Wang,Yuan Honglocation-based services may lead to several privacy threats ranging from worries over employers snooping on their workers’ whereabouts to fears of tracking by potential stalkers. While there exist several techniques to preserve location privacy in mobile environments, these techniques are limited as作者: Lice692 時(shí)間: 2025-3-24 07:50 作者: onlooker 時(shí)間: 2025-3-24 12:28
Panoramic Human Activity Recognition,jects are not described exactly. Therefore, recent solutions propose to model data objects by probability density functions(pdf). Since a pdf describing an uncertain object is often not explicitly known, approximation techniques like Gaussian mixture models(GMM) need to be employed. In this paper, w作者: 疼死我了 時(shí)間: 2025-3-24 15:26 作者: REIGN 時(shí)間: 2025-3-24 19:00 作者: aesthetic 時(shí)間: 2025-3-25 02:43 作者: 獸皮 時(shí)間: 2025-3-25 04:06
0302-9743 Overview: 978-3-540-73539-7978-3-540-73540-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: MURKY 時(shí)間: 2025-3-25 08:18
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/149843.jpg作者: Allege 時(shí)間: 2025-3-25 14:22
https://doi.org/10.1007/978-3-540-73540-3algorithms; continuous query processing; data mining; database; databases; distributed systems; fastest pa作者: impale 時(shí)間: 2025-3-25 16:39 作者: 指令 時(shí)間: 2025-3-25 22:55
Continuous Monitoring of Exclusive Closest Pairs,osest pair (.,.) in . ×. is in the result and (ii) the remaining pairs are determined by removing objects .,. from .,. respectively, and recursively searching for the next closest pair. An application of exclusive closest pairs is the computation of (car, parking slot) assignments. In this paper, we作者: 競選運(yùn)動(dòng) 時(shí)間: 2025-3-26 00:48 作者: right-atrium 時(shí)間: 2025-3-26 08:14 作者: intoxicate 時(shí)間: 2025-3-26 09:27 作者: 分散 時(shí)間: 2025-3-26 13:40
Generalizing the Optimality of Multi-step ,-Nearest Neighbor Query Processing, containing complex objects and defining costly distance functions on spatial, temporal and multimedia data. Rather, the use of an adequate multi-step query processing strategy is crucial for the performance of a similarity search routine that deals with complex distance functions. Reducing the numb作者: 無可非議 時(shí)間: 2025-3-26 17:00
S-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks, to a spatial network, e.g., a road network, through which points of interest, termed data points, are accessible. Queries that implement services will often concern data points of some specific type, e.g., Thai restaurants or art museums. As a result, the relatively few data points are relevant to 作者: 水槽 時(shí)間: 2025-3-26 23:08
Efficiently Mining Regional Outliers in Spatial Data,e database and data mining community. As a very prominent method, the spatial scan statistic finds a region that deviates (most) significantly from the entire dataset. In this paper, we introduce the novel problem of mining regional outliers in spatial data. A spatial regional outlier is a rectangul作者: Minikin 時(shí)間: 2025-3-27 02:18
A Two Round Reporting Approach to Energy Efficient Interpolation of Sensor Fields,research. However, aggregated values of a sensor field are of limited use in natural science domains because many phenomena, e.g., temperature and soil moisture, are actually continuous and thus best represented as a continuous surface over the sensor fields. Energy efficient collection of readings 作者: Fibrillation 時(shí)間: 2025-3-27 06:15 作者: atopic-rhinitis 時(shí)間: 2025-3-27 09:59
Spatial Partition Graphs: A Graph Theoretic Model of Maps,ise spatial data type for . for use in spatial systems. In this paper, we consider a subclass of map geometries known as . that are able to model maps containing region features. However, spatial partitions are defined using concepts such as infinite point sets that cannot be directly represented in作者: Amenable 時(shí)間: 2025-3-27 16:58
Geographic Ontology Matching with ,,them. In this paper we define a geographic ontology reference model and, from it, the set of heterogeneities that may occur when comparing two geographic ontologies is elaborated, at both the concept and instance-level. Based on the heterogeneities set we then present the ., which consists in a soft作者: Lasting 時(shí)間: 2025-3-27 20:30 作者: 大罵 時(shí)間: 2025-3-28 01:02 作者: 妨礙 時(shí)間: 2025-3-28 05:00 作者: Aura231 時(shí)間: 2025-3-28 09:43
Enabling Private Continuous Queries for Revealed User Locations,location-based services may lead to several privacy threats ranging from worries over employers snooping on their workers’ whereabouts to fears of tracking by potential stalkers. While there exist several techniques to preserve location privacy in mobile environments, these techniques are limited as作者: 高貴領(lǐng)導(dǎo) 時(shí)間: 2025-3-28 13:51
Computing a ,-Route over Uncertain Geographical Data,cating how likely it is for the object to be correct. Uncertain data can be the result of operations such as imprecise integration, incorrect update or inexact querying. A ., over an uncertain geo-spatial dataset, is a path that travels through the geo-spatial objects, starting at a given location a作者: 陰險(xiǎn) 時(shí)間: 2025-3-28 15:43 作者: IDEAS 時(shí)間: 2025-3-28 19:28 作者: Generic-Drug 時(shí)間: 2025-3-29 00:37 作者: exercise 時(shí)間: 2025-3-29 03:48
https://doi.org/10.1007/978-3-031-20086-1the current medoid set. Next, we address . monitoring, where we assume that the data points have some computational capabilities, and they take over part of the monitoring task. In particular, the server installs adaptive filters (i.e., permissible spatial ranges, called .) to the points, which repo作者: 內(nèi)行 時(shí)間: 2025-3-29 08:10
Kim Youwang,Kim Ji-Yeon,Tae-Hyun Ohted distance function defines an adjusted order of appearance for data objects in the visualization space and, thus, supports quick first views. By a novel incremental concept of view-dependent result streaming which interactively follows dynamic changes of users’ viewpoints and view directions, we 作者: chance 時(shí)間: 2025-3-29 15:28
Qingpei Guo,Kaisheng Yao,Wei Chureducing the number of candidates. In this paper, we generalize the traditional concept of .-optimality and introduce the notion of ..-optimality depending on the distance information . available in the filter step. We propose a new multi-step .NN search algorithm that utilizes lower- and upper boun作者: 舞蹈編排 時(shí)間: 2025-3-29 15:43 作者: 袋鼠 時(shí)間: 2025-3-29 22:37
Shai Avidan,Gabriel Brostow,Tal Hassnerbject per iteration, choosing the extension which leads to the largest increase of the objective function. Our experimental evaluation on synthetic datasets and a real dataset demonstrates the meaningfulness of this new type of outliers and the greatly superior efficiency of the proposed algorithms.作者: 流行 時(shí)間: 2025-3-29 23:57 作者: 沖突 時(shí)間: 2025-3-30 04:22
Runyu Ding,Jihan Yang,Li Jiang,Xiaojuan Qithe first one refers to trajectory compression of individual objects; the other offers estimated aggregates of moving object locations across time. Both techniques are validated with comprehensive experiments, confirming their suitability in maintaining online concise synopses for moving objects.作者: 獨(dú)輪車 時(shí)間: 2025-3-30 09:48
Hao Lu,Wenze Liu,Hongtao Fu,Zhiguo Cao regions. Our model focuses on leveraging information about the . topological relationships that hold between the components of two spatial objects, thereby providing a . view of the overall global topological relationship.作者: syring 時(shí)間: 2025-3-30 13:48
Qihang Zhang,Zhenghao Peng,Bolei Zhouystem is used to anonymize a query by mapping it to a random group of . users that are consecutive in the 1-D space. Compared to existing state-of-the-art, . does not provide theoretical anonymity guarantees for skewed query distributions. Nevertheless, it achieves strong anonymity in practice, and 作者: 惡臭 時(shí)間: 2025-3-30 17:11
,Tracking by?Associating Clips,uch approaches treat points as vectors in space and do not exploit their spatial properties. In contrast, we use Hilbert curves as efficient one-way transformations and design algorithms to evaluate a KNN query in the Hilbert transformed space. Consequently, we reduce the complexity of computing a K作者: tendinitis 時(shí)間: 2025-3-31 00:46
Hanbin Hong,Binghui Wang,Yuan Hongnguishes between location privacy and query privacy. By this distinction, we achieve two main goals: (1)?supporting private location-based services to those customers with public locations, and (2)?performing spatial cloaking on-demand basis only (i.e., when issuing queries) rather than exhaustively作者: chance 時(shí)間: 2025-3-31 04:17
Qi Fan,Chi-Keung Tang,Yu-Wing Tai-time algorithm that solves the problem (unless P=NP). Hence, in this work we consider heuristics for the problem. Three methods for computing a short .-route are presented. The three methods are compared analytically and experimentally. For these three methods, experiments on both synthetic and rea作者: 難解 時(shí)間: 2025-3-31 08:06 作者: ANT 時(shí)間: 2025-3-31 09:36 作者: Mri485 時(shí)間: 2025-3-31 17:18 作者: 集合 時(shí)間: 2025-3-31 18:11 作者: 刺激 時(shí)間: 2025-4-1 00:03
Generalizing the Optimality of Multi-step ,-Nearest Neighbor Query Processing,reducing the number of candidates. In this paper, we generalize the traditional concept of .-optimality and introduce the notion of ..-optimality depending on the distance information . available in the filter step. We propose a new multi-step .NN search algorithm that utilizes lower- and upper boun作者: archaeology 時(shí)間: 2025-4-1 01:57 作者: CRUC 時(shí)間: 2025-4-1 08:20
Efficiently Mining Regional Outliers in Spatial Data,bject per iteration, choosing the extension which leads to the largest increase of the objective function. Our experimental evaluation on synthetic datasets and a real dataset demonstrates the meaningfulness of this new type of outliers and the greatly superior efficiency of the proposed algorithms.作者: scrape 時(shí)間: 2025-4-1 12:18 作者: ETCH 時(shí)間: 2025-4-1 14:41
