標(biāo)題: Titlebook: Advances in Spatial and Temporal Databases; 9th International Sy Claudia Bauzer Medeiros,Max J. Egenhofer,Elisa Ber Conference proceedings [打印本頁] 作者: 嚴(yán)峻 時(shí)間: 2025-3-21 18:42
書目名稱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é)科排名
作者: osculate 時(shí)間: 2025-3-21 23:11 作者: Foreknowledge 時(shí)間: 2025-3-22 01:32 作者: 蛤肉 時(shí)間: 2025-3-22 05:27
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Datat data to more general spatial extents in which the incoming imagery can be single pixels, rows of pixels, or discrete parts of images. The . exploits spatial trends in incoming RSI data to efficiently filter the data of interest to the individual query regions. Experimental results using random inp作者: 公共汽車 時(shí)間: 2025-3-22 10:00 作者: APEX 時(shí)間: 2025-3-22 13:13
Accurate and Efficient Similarity Search on 3D Objects Using Point Sampling, Redundancy, and Proportular, we experimentally confirm that our point sampling method is better suited to represent 3D objects in the context of rotation invariance than voxelized representations. In addition, we empirically show that our new similarity model significantly outperfoms competitive rotation invariant models 作者: abstemious 時(shí)間: 2025-3-22 19:29 作者: 充滿人 時(shí)間: 2025-3-22 23:34 作者: 改變 時(shí)間: 2025-3-23 05:18
On Trip Planning Queries in Spatial Databasesnumber of points per category or both. Therefore, for different instances of the problem, we can choose the algorithm with the best approximation ratio, since they all run in polynomial time. Furthermore, we use some of the proposed algorithms to derive efficient heuristics for large datasets stored作者: FLORA 時(shí)間: 2025-3-23 05:43
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Resultsstraints. It addresses the limitations of linear programming approach by using only the original evacuation network and it does not require prior knowledge of evacuation time. Performance evaluation on various network configurations shows that the CCRP algorithm produces high quality solutions, and 作者: Phonophobia 時(shí)間: 2025-3-23 10:50 作者: BROW 時(shí)間: 2025-3-23 16:41 作者: 使隔離 時(shí)間: 2025-3-23 19:35
https://doi.org/10.1007/978-3-031-19784-0equipped with a periodicity detection procedure that predicts the future execution of the continuous queries. Hence, the query processing engine can continuously adapt the continuous query pipeline to reflect this prediction. Experimental results based on a real implementation inside a data stream m作者: PANIC 時(shí)間: 2025-3-24 00:02 作者: 星球的光亮度 時(shí)間: 2025-3-24 05:09 作者: leniency 時(shí)間: 2025-3-24 07:54 作者: 法官 時(shí)間: 2025-3-24 13:46
Shai Avidan,Gabriel Brostow,Tal Hassnerular, we experimentally confirm that our point sampling method is better suited to represent 3D objects in the context of rotation invariance than voxelized representations. In addition, we empirically show that our new similarity model significantly outperfoms competitive rotation invariant models 作者: AMBI 時(shí)間: 2025-3-24 17:27
Calibration-Free Multi-view Crowd Counting,th the highest aggregates. In this paper, we study the integration of the top-k operator with the aggregate query processing module. For this, we make use of spatial indexes, augmented with aggregate information, like the aggregate R–tree. We device a branch-and-bound algorithm that accesses a minim作者: 收到 時(shí)間: 2025-3-24 22:07 作者: 職業(yè)拳擊手 時(shí)間: 2025-3-24 23:59 作者: 精致 時(shí)間: 2025-3-25 03:57 作者: Anthropoid 時(shí)間: 2025-3-25 10:34 作者: flavonoids 時(shí)間: 2025-3-25 13:12 作者: bifurcate 時(shí)間: 2025-3-25 16:47
0302-9743 hniques and query processing, mobile environments and moving objects, and spatial and temporal data streams. We are very pleased with the variety of the symposi978-3-540-28127-6978-3-540-31904-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Glucocorticoids 時(shí)間: 2025-3-25 20:40
Claudia Bauzer Medeiros,Max J. Egenhofer,Elisa Ber作者: Insulin 時(shí)間: 2025-3-26 02:07 作者: BOOR 時(shí)間: 2025-3-26 07:10 作者: Type-1-Diabetes 時(shí)間: 2025-3-26 12:17 作者: 極小量 時(shí)間: 2025-3-26 15:30
Medoid Queries in Large Spatial Databasesd. This is an instance of the .-. problem, where residential blocks constitute the input dataset and the . branch locations correspond to the medoids. Since the problem is NP-hard, research has focused on approximate solutions. Despite an avalanche of methods for small and moderate size datasets, cu作者: 取消 時(shí)間: 2025-3-26 18:58
The Islands Approach to Nearest Neighbor Querying in Spatial Networkssers are constrained to a transportation network. As a result, query processing in spatial road networks is of interest. We propose a versatile approach to . nearest neighbor computation in spatial networks, termed the Islands approach. By offering flexible yet simple means of balancing re-computati作者: Paradox 時(shí)間: 2025-3-26 22:58 作者: 闖入 時(shí)間: 2025-3-27 01:18
Density Estimation for Spatial Data Streams Local Kernels, for computing density estimators by using local rather than global statistics on the data. The approach is easy to extend to an on-line setting, by maintaining a small random sample with a kd-tree-like structure on top of it. Our structure dynamically adapts to changes in the localit作者: Habituate 時(shí)間: 2025-3-27 07:48 作者: Panther 時(shí)間: 2025-3-27 10:30 作者: Ceramic 時(shí)間: 2025-3-27 16:30 作者: 性上癮 時(shí)間: 2025-3-27 20:59 作者: Omnipotent 時(shí)間: 2025-3-28 00:22
Accurate and Efficient Similarity Search on 3D Objects Using Point Sampling, Redundancy, and Proporteffectively search for these 3D objects become indispensible. Invariances w.r.t. specific geometric transformations such as scaling, translation, and rotation are important features of similarity models. In this paper, we focus on rotation invariance. We first propose a new method of representing ob作者: entice 時(shí)間: 2025-3-28 04:44 作者: LUT 時(shí)間: 2025-3-28 07:05
Evaluation of Top-k OLAP Queries Using Aggregate R–Treese value. An example of such a query is “find the 10 combinations of product-type and month with the largest sum of sales”. Such queries may also be applied in a spatial database context, where objects are augmented with some measures that must be aggregated according to a spatial division. For insta作者: narcotic 時(shí)間: 2025-3-28 14:18
PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectoriesport complex spatio-temporal queries on such data. Current work in this domain has used MBRs to approximate trajectories, which fail to capture some basic properties of trajectories, including smoothness and lack of internal area. This mismatch leads to poor pruning when such indices are used. In th作者: Costume 時(shí)間: 2025-3-28 16:56 作者: 集聚成團(tuán) 時(shí)間: 2025-3-28 22:50
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Resultsols are needed to produce evacuation plans that identify routes and schedules to evacuate affected populations to safety in the event of natural disasters or terrorist attacks. The existing linear programming approach uses time-expanded networks to compute the optimal evacuation plan and requires a 作者: 混合物 時(shí)間: 2025-3-29 02:32 作者: Feature 時(shí)間: 2025-3-29 04:07
Nearest Neighbor Search on Moving Object Trajectoriesthe vehicle for data analysis, thus improving existing or even proposing new services. In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. The proposed branch-and-bound algorithms vary with respect t作者: radiograph 時(shí)間: 2025-3-29 09:02 作者: circuit 時(shí)間: 2025-3-29 13:11 作者: SSRIS 時(shí)間: 2025-3-29 18:01
,Detecting Generated Images by?Real Images,, namely, cellular network trajectory and symbolic location tracking. The experimental results show that GAMMA can efficiently and robustly produce high quality moving object datasets for various simulation objectives.作者: AND 時(shí)間: 2025-3-29 19:56 作者: 你敢命令 時(shí)間: 2025-3-30 00:57
https://doi.org/10.1007/978-3-031-19800-7iciently and accurately. Our analytical and empirical results show that our approach outperforms the best known change detection approach in terms of both performance and accuracy. Furthermore, unlike the state of the art approaches, our query response time is independent of the number of change points and the user-defined change threshold.作者: avulsion 時(shí)間: 2025-3-30 06:02 作者: 旋轉(zhuǎn)一周 時(shí)間: 2025-3-30 11:19 作者: 精確 時(shí)間: 2025-3-30 13:04
Haoran Wei,Xin Chen,Lingxi Xie,Qi Tianarge parts of the input dataset. In a final step, the optimal (.-autonomy or .-stops) path is computed (using only the non-eliminated data points) by an exact algorithm. We discuss several processing methods for both problems, and evaluate their efficiency through extensive experiments.作者: 粗語 時(shí)間: 2025-3-30 16:32 作者: Relinquish 時(shí)間: 2025-3-30 21:43 作者: 單獨(dú) 時(shí)間: 2025-3-31 01:24
Constrained Shortest Path Computationarge parts of the input dataset. In a final step, the optimal (.-autonomy or .-stops) path is computed (using only the non-eliminated data points) by an exact algorithm. We discuss several processing methods for both problems, and evaluate their efficiency through extensive experiments.作者: 數(shù)量 時(shí)間: 2025-3-31 08:14 作者: ASSAY 時(shí)間: 2025-3-31 09:27 作者: 煩憂 時(shí)間: 2025-3-31 15:20 作者: BALE 時(shí)間: 2025-3-31 17:43 作者: 小口啜飲 時(shí)間: 2025-3-31 23:14 作者: electrolyte 時(shí)間: 2025-4-1 05:38
Shai Avidan,Gabriel Brostow,Tal Hassnery of data and has small update time. Experimental results show that the proposed algorithm returns good approximate results for a variety of data and query distributions. We also show that it is useful in off-line computations, as well.作者: Inelasticity 時(shí)間: 2025-4-1 09:26
0302-9743 STD 2005. This year’s symposium continues the tradition of being the premier forum for the presentation of research results and experience reports on leading edge issues of spatialandtemporaldatabasesystems, including data models,systems,appli- tions and theory. The mission of the symposium is to sh作者: ineffectual 時(shí)間: 2025-4-1 11:44
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/149842.jpg作者: FLIP 時(shí)間: 2025-4-1 14:25
Advances in Spatial and Temporal Databases978-3-540-31904-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
