找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Spatio-temporal Networks; Modeling and Algorit Betsy George,Sangho Kim Book 2013 The Author(s) 2013 Data models.Indexing methods.Query lang

[复制链接]
查看: 52392|回复: 35
发表于 2025-3-21 19:39:00 | 显示全部楼层 |阅读模式
书目名称Spatio-temporal Networks
副标题Modeling and Algorit
编辑Betsy George,Sangho Kim
视频video
概述Includes supplementary material:
丛书名称SpringerBriefs in Computer Science
图书封面Titlebook: Spatio-temporal Networks; Modeling and Algorit Betsy George,Sangho Kim Book 2013 The Author(s) 2013 Data models.Indexing methods.Query lang
描述.Spatio-temporal networks (STN)are spatial networks whose topology and/or attributes change with time. These are encountered in many critical areas of everyday life such as transportation networks, electric power distribution grids, and social networks of mobile users. STN modeling and computations raise significant challenges. The model must meet the conflicting requirements of simplicity and adequate support for efficient algorithms. Another challenge is to address the change in the semantics of common graph operations, such as, shortest path computation assuming different semantics, or when temporal dimension is added. Also paradigms (e.g. dynamic programming) used in algorithm design may be ineffective since their assumptions (e.g. stationary ranking of candidates) may be violated by the dynamic nature of STNs. .In recent years, STNs have attracted attention in research. New representations have been proposed along with algorithms to perform key STN operations, while accounting for their time dependence. Designing a STN database would require the development of data models, query languages, and indexing methods to efficiently represent, query, store, and manage time-variant pro
出版日期Book 2013
关键词Data models; Indexing methods; Query languages; STN operations; Shortest path computation; Spatial databa
版次1
doihttps://doi.org/10.1007/978-1-4614-4918-8
isbn_softcover978-1-4614-4917-1
isbn_ebook978-1-4614-4918-8Series ISSN 2191-5768 Series E-ISSN 2191-5776
issn_series 2191-5768
copyrightThe Author(s) 2013
The information of publication is updating

书目名称Spatio-temporal Networks影响因子(影响力)




书目名称Spatio-temporal Networks影响因子(影响力)学科排名




书目名称Spatio-temporal Networks网络公开度




书目名称Spatio-temporal Networks网络公开度学科排名




书目名称Spatio-temporal Networks被引频次




书目名称Spatio-temporal Networks被引频次学科排名




书目名称Spatio-temporal Networks年度引用




书目名称Spatio-temporal Networks年度引用学科排名




书目名称Spatio-temporal Networks读者反馈




书目名称Spatio-temporal Networks读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:01:44 | 显示全部楼层
发表于 2025-3-22 04:16:40 | 显示全部楼层
Betsy George,Sangho KimIncludes supplementary material:
发表于 2025-3-22 07:53:35 | 显示全部楼层
发表于 2025-3-22 10:53:26 | 显示全部楼层
发表于 2025-3-22 15:39:21 | 显示全部楼层
发表于 2025-3-22 19:16:33 | 显示全部楼层
Time Aggregated Graph: A Model for Spatio-temporal Networks,significance of such networks in critical domains such as transportation science and sensor data analysis, the importance of a model that is simple, expressive and storage efficient to represent such networks cannot be understated. The model must provide support for the design of algorithms to proce
发表于 2025-3-22 22:23:26 | 显示全部楼层
发表于 2025-3-23 02:48:19 | 显示全部楼层
发表于 2025-3-23 05:42:24 | 显示全部楼层
Best Start Time Journeys,e start time. This leads to an important and interesting formulation of shortest path computation, “When is the best time to start a journey so that the time spent in the network is minimized?” This chapter describes this formulation in detail and presents algorithms for the computation of ‘best start time’ shortest paths.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 14:01
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表