標(biāo)題: Titlebook: Spatial and Temporal Databases; 13th International S Mario A. Nascimento,Timos Sellis,Christian Sengsto Conference proceedings 2013 Springe [打印本頁] 作者: detumescence 時(shí)間: 2025-3-21 19:39
書目名稱Spatial and Temporal Databases影響因子(影響力)
書目名稱Spatial and Temporal Databases影響因子(影響力)學(xué)科排名
書目名稱Spatial and Temporal Databases網(wǎng)絡(luò)公開度
書目名稱Spatial and Temporal Databases網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Spatial and Temporal Databases被引頻次
書目名稱Spatial and Temporal Databases被引頻次學(xué)科排名
書目名稱Spatial and Temporal Databases年度引用
書目名稱Spatial and Temporal Databases年度引用學(xué)科排名
書目名稱Spatial and Temporal Databases讀者反饋
書目名稱Spatial and Temporal Databases讀者反饋學(xué)科排名
作者: apiary 時(shí)間: 2025-3-21 21:36
Marah Halawa,Olaf Hellwich,Pia Bideau algorithms based on self pruning without precomputation produce better results. During an extensive performance analysis we provide evaluation results showing the IO and CPU performance of the compared algorithms for a wide range of different setups and suggest appropriate query algorithms for specific scenarios.作者: Preamble 時(shí)間: 2025-3-22 03:01
Kaidong Zhang,Jingjing Fu,Dong Liuto summarize and select collections of georeferenced media items in P2P systems. Generally, these summarization techniques can be divided into geometric and space partitioning approaches. This paper presents and evaluates techniques of a third category, hybrid approaches that combine features of geometric and space partitioning techniques.作者: MUMP 時(shí)間: 2025-3-22 07:29
Energy Efficient In-Network Data Indexing for Mobile Wireless Sensor Networkssed on locally expanding and shrinking convex regions such that update costs are minimized. Based on SIDnet-SWANS simulator, our experimental results demonstrate the effectiveness of the proposed protocol under different mobility models, mobility speeds, and query streams.作者: 演講 時(shí)間: 2025-3-22 11:14
Reverse-k-Nearest-Neighbor Join Processing algorithms based on self pruning without precomputation produce better results. During an extensive performance analysis we provide evaluation results showing the IO and CPU performance of the compared algorithms for a wide range of different setups and suggest appropriate query algorithms for specific scenarios.作者: 易受騙 時(shí)間: 2025-3-22 16:24
Using Hybrid Techniques for Resource Description and Selection in the Context of Distributed Geograpto summarize and select collections of georeferenced media items in P2P systems. Generally, these summarization techniques can be divided into geometric and space partitioning approaches. This paper presents and evaluates techniques of a third category, hybrid approaches that combine features of geometric and space partitioning techniques.作者: 增長 時(shí)間: 2025-3-22 19:40 作者: 暫時(shí)中止 時(shí)間: 2025-3-22 22:54 作者: 無脊椎 時(shí)間: 2025-3-23 01:48 作者: syring 時(shí)間: 2025-3-23 07:04 作者: resilience 時(shí)間: 2025-3-23 10:27
0302-9743 resented were carefully reviewed and selected from 58 submissions. The papers are organized in topical sections on joins and algorithms; mining and discovery; indexing; trajectories and road network data; nearest neighbours queries; uncertainty; and demonstrations.978-3-642-40234-0978-3-642-40235-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: faction 時(shí)間: 2025-3-23 15:33
Junyong Park,Yong-Hyuk Moon,Yong-Ju Leeb-trajectory cliques. Since mining all sub-trajectory cliques is NP-Complete, we proposed two approximate algorithms based on the . algorithm. Empirical results showed that our algorithms can run fast and their results are intuitive.作者: 少量 時(shí)間: 2025-3-23 21:48
0302-9743 f the 13th International Symposium on Spatial and Temporal Databases, SSTD 2013, held in Munich, Germany, in August 2013. The 24 revised full papers presented were carefully reviewed and selected from 58 submissions. The papers are organized in topical sections on joins and algorithms; mining and di作者: alleviate 時(shí)間: 2025-3-24 01:49
Efficient Top-, Spatial Distance Joinsg top-. join computation by accessing a limited number of objects. Extensive experiments demonstrate that a technique which accesses blocks of data from . and . ordered by the object scores and then joins them using an aR-tree based module performs best in practice and outperforms alternative solutions by a wide margin.作者: critic 時(shí)間: 2025-3-24 05:22 作者: 格言 時(shí)間: 2025-3-24 08:24 作者: 一起 時(shí)間: 2025-3-24 13:53
Conference proceedings 2013ny, in August 2013. The 24 revised full papers presented were carefully reviewed and selected from 58 submissions. The papers are organized in topical sections on joins and algorithms; mining and discovery; indexing; trajectories and road network data; nearest neighbours queries; uncertainty; and de作者: GOUGE 時(shí)間: 2025-3-24 14:54 作者: 鐵砧 時(shí)間: 2025-3-24 21:28 作者: 吹牛需要藝術(shù) 時(shí)間: 2025-3-25 00:44 作者: bacteria 時(shí)間: 2025-3-25 06:52
Capacity-Constrained Network-Voronoi Diagram: A Summary of Resultsce areas that meet service center capacities and minimize the sum of the distances (min-sum) from graph-nodes to allotted service centers. The CCNVD problem is important for critical societal applications such as assigning evacuees to shelters and assigning patients to hospitals. This problem is NP-作者: Munificent 時(shí)間: 2025-3-25 09:37 作者: Salivary-Gland 時(shí)間: 2025-3-25 14:42 作者: 臭名昭著 時(shí)間: 2025-3-25 19:54
Discovering Influential Data Objects over Timegnificant number of customers. However, customer preferences change over time, and product manufacturers are interested in monitoring the evolution of the popularity of their products, in order to discover those products that are consistently highly ranked. To take into account the temporal dimensio作者: aneurysm 時(shí)間: 2025-3-25 20:09
Finding Traffic-Aware Fastest Paths in Spatial Networksfinding traffic-aware fastest paths (TAFP query) in spatial networks by considering the related traffic conditions. Given a sequence of user specified intended places .. and a departure time ., TAFP finds the fastest path connecting .. in order to guarantee that moving objects (e.g., travelers and b作者: 表示向下 時(shí)間: 2025-3-26 01:51 作者: Muscularis 時(shí)間: 2025-3-26 07:46 作者: 和平 時(shí)間: 2025-3-26 11:46
PL-Tree: An Efficient Indexing Method for High-Dimensional Dataethod for a given set of data requires careful consideration of data properties, data construction methods, and query types. We present a new indexing method to support efficient point queries, range queries, and .-nearest neighbor queries. Our method indexes objects dynamically using algebraic tech作者: 欲望 時(shí)間: 2025-3-26 15:41 作者: Adornment 時(shí)間: 2025-3-26 20:21
Best Upgrade Plans for Large Road Networkswork (weighted graph) . where a subset of the edges are ., i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in ., and a budget (resource constraint) ., the BUP problem is to identify which upgrad作者: 發(fā)源 時(shí)間: 2025-3-27 00:58 作者: 欄桿 時(shí)間: 2025-3-27 03:46 作者: 教唆 時(shí)間: 2025-3-27 09:11
Reverse-k-Nearest-Neighbor Join Processingsuch a query has received plenty of attention in research. However, the effect of running multiple R.NN queries at once (join) or within a short time interval (bulk/group query) has only received little attention so far. In this paper, we analyze different types of R.NN joins and discuss possible so作者: 無可爭辯 時(shí)間: 2025-3-27 11:01 作者: 耐寒 時(shí)間: 2025-3-27 17:19 作者: 致詞 時(shí)間: 2025-3-27 20:51 作者: placebo 時(shí)間: 2025-3-28 00:58
https://doi.org/10.1007/978-3-642-40235-7geographic information retrieval; social web; spatial networks; traffic data; trajectory querying作者: harpsichord 時(shí)間: 2025-3-28 02:48 作者: palette 時(shí)間: 2025-3-28 07:52
Spatial and Temporal Databases978-3-642-40235-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 過于光澤 時(shí)間: 2025-3-28 13:00 作者: 燒烤 時(shí)間: 2025-3-28 15:24
Computer Vision – ECCV 2020 Workshopser ., the top-. spatial distance join (.) returns the . pairs of objects, which have the highest combined score (based on an aggregate function .) among all object pairs in .×. which have spatial distance at most .. Despite the practical application value of this query, it has not received adequate 作者: FEMUR 時(shí)間: 2025-3-28 22:35
https://doi.org/10.1007/978-3-030-65414-6imity of certain type of pollution. This paper studies the problem of regional co-locations with arbitrary shapes. Regional co-locations represent regions in which two spatial features exhibit stronger or weaker co-location than that in other regions. Finding regional co-locations of arbitrary shape作者: 晚間 時(shí)間: 2025-3-29 01:38 作者: 痛恨 時(shí)間: 2025-3-29 03:13
Lecture Notes in Computer Sciencece areas that meet service center capacities and minimize the sum of the distances (min-sum) from graph-nodes to allotted service centers. The CCNVD problem is important for critical societal applications such as assigning evacuees to shelters and assigning patients to hospitals. This problem is NP-作者: Visual-Acuity 時(shí)間: 2025-3-29 08:33
Computer Vision – ECCV 2020 Workshopsedict routes actually being selected by real drivers, trajectory mining techniques predict routes based on observations rather than calculated paths. Most approaches to this task build statistical models for the likelihood that a user travels along certain segments of a road network. However, these 作者: Contracture 時(shí)間: 2025-3-29 13:01 作者: 描述 時(shí)間: 2025-3-29 16:53 作者: Deference 時(shí)間: 2025-3-29 21:52
Alfred Laugros,Alice Caplier,Matthieu Ospicifinding traffic-aware fastest paths (TAFP query) in spatial networks by considering the related traffic conditions. Given a sequence of user specified intended places .. and a departure time ., TAFP finds the fastest path connecting .. in order to guarantee that moving objects (e.g., travelers and b作者: Moderate 時(shí)間: 2025-3-30 00:17 作者: 效果 時(shí)間: 2025-3-30 05:54 作者: 調(diào)整校對(duì) 時(shí)間: 2025-3-30 08:45
,Learning to?Fit Morphable Models,ethod for a given set of data requires careful consideration of data properties, data construction methods, and query types. We present a new indexing method to support efficient point queries, range queries, and .-nearest neighbor queries. Our method indexes objects dynamically using algebraic tech作者: indemnify 時(shí)間: 2025-3-30 13:04
Lecture Notes in Computer Sciencesubjects (e.g., wild animals, people, vehicles). Using trajectory data harvested by devices, such as GPS, RFID and mobile devices, complex pattern queries can be posed to select trajectories based on specific events of interest. In this paper, we present a study on FPGA-based architectures processin作者: Physiatrist 時(shí)間: 2025-3-30 20:26
Yukun Su,Guosheng Lin,Ruizhou Sun,Qingyao Wuwork (weighted graph) . where a subset of the edges are ., i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in ., and a budget (resource constraint) ., the BUP problem is to identify which upgrad作者: 邊緣帶來墨水 時(shí)間: 2025-3-30 23:47 作者: 凈禮 時(shí)間: 2025-3-31 04:44 作者: finite 時(shí)間: 2025-3-31 06:37
Marah Halawa,Olaf Hellwich,Pia Bideausuch a query has received plenty of attention in research. However, the effect of running multiple R.NN queries at once (join) or within a short time interval (bulk/group query) has only received little attention so far. In this paper, we analyze different types of R.NN joins and discuss possible so作者: 不能強(qiáng)迫我 時(shí)間: 2025-3-31 09:29
https://doi.org/10.1007/978-3-031-19821-2 two disjoint sets, . and ., of spatial objects, and a query object . in ., the DBR.NN query returns a subset .′ of . such that . nearest neighbors of each object in .′ include . and each object in .′ has a direction toward . within a pre-defined distance.We formally define the DBR.NN query, and the作者: Terminal 時(shí)間: 2025-3-31 13:59
Romain Loiseau,Mathieu Aubry,Lo?c Landrieuservices. In this work, we investigate the case of Location-based Services and specifically of how to improve the typical location-based Point-Of-Interest (POI) request processed as a .-Nearest-Neighbor query. This work introduces Links-of-interest (LOI) between POIs as a means to increase the relev作者: 低能兒 時(shí)間: 2025-3-31 17:38
Kaidong Zhang,Jingjing Fu,Dong Liuthese massive amounts of media objects, there is a strong need for adequate indexing and search techniques. Trends like social networks, large-storage mobile devices and high-bandwidth networks make peer-to-peer (P2P) information retrieval systems of deep interest..Hence, resource selection based on作者: 生命 時(shí)間: 2025-3-31 22:08
Mario A. Nascimento,Timos Sellis,Christian SengstoProceedings of the 13th International Symposium on Spatial and Temporal Databases, SSTD 2013作者: Aromatic 時(shí)間: 2025-4-1 04:01
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/149841.jpg作者: 證明無罪 時(shí)間: 2025-4-1 09:35
https://doi.org/10.1007/978-3-030-65414-6how that both frequentist method and Bayesian statistical approach can recover the region with arbitrary shapes. Our approaches outperform baseline algorithms in terms of F measure. Bayesian statistical approach is approximately three orders of magnitude faster than the frequentist approach.作者: 統(tǒng)治人類 時(shí)間: 2025-4-1 10:43
Jonah Philion,Amlan Kar,Sanja Fidlerrs. MNTG does not provide a new way to simulate traffic data. Instead, it serves as a wrapper over existing traffic generators, making them easy to use, configure, and run for any arbitrary spatial road region. To generate traffic data, MNTG users just need to use its user-friendly web interface to 作者: Antagonist 時(shí)間: 2025-4-1 15:45
Lecture Notes in Computer ScienceVD to meet the capacity constraints of service centers while maintaining the contiguity of service areas. Experiments and a case study using post-hurricane Sandy scenarios demonstrate that the proposed algorithm has comparable solution quality to min-cost flow in terms of min-sum; furthermore it cre作者: 影響帶來 時(shí)間: 2025-4-1 22:24
Computer Vision – ECCV 2020 Workshopspreference distribution, it is possible to compute a shortest path which better reflects actual driving decisions. We propose an efficient algorithm for deriving a distribution function of the preference weightings of a user by comparing observed routes to a set of pareto-optimal paths. In our exper作者: 大吃大喝 時(shí)間: 2025-4-2 00:06
