Titlebook: Advances in Spatial and Temporal Databases; 9th International Sy Claudia Bauzer Medeiros,Max J. Egenhofer,Elisa Ber Conference proceedings

嚴(yán)峻

書目名稱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

Foreknowledge

蛤肉

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

公共汽車

APEX

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

充滿人

改變

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

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