標(biāo)題: Titlebook: Web and Wireless Geographical Information Systems; 12th International S Steve H. L. Liang,Xin Wang,Christophe Claramunt Conference proceedi [打印本頁] 作者: OBESE 時間: 2025-3-21 17:22
書目名稱Web and Wireless Geographical Information Systems影響因子(影響力)
書目名稱Web and Wireless Geographical Information Systems影響因子(影響力)學(xué)科排名
書目名稱Web and Wireless Geographical Information Systems網(wǎng)絡(luò)公開度
書目名稱Web and Wireless Geographical Information Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Web and Wireless Geographical Information Systems被引頻次
書目名稱Web and Wireless Geographical Information Systems被引頻次學(xué)科排名
書目名稱Web and Wireless Geographical Information Systems年度引用
書目名稱Web and Wireless Geographical Information Systems年度引用學(xué)科排名
書目名稱Web and Wireless Geographical Information Systems讀者反饋
書目名稱Web and Wireless Geographical Information Systems讀者反饋學(xué)科排名
作者: 發(fā)牢騷 時間: 2025-3-21 21:15 作者: 躲債 時間: 2025-3-22 03:07 作者: CRAFT 時間: 2025-3-22 08:07 作者: 使堅硬 時間: 2025-3-22 08:55
Weicheng Qian,Kevin G. Stanley,Nathaniel D. Osgoodtation wurde nicht mit der Zielsetzung angegangen, eine m?glichst effiziente Grundlage für eine konkret vorliegende Anwendung zu liefern, sondern die Zielsetzung war das Anstreben gr??tm?glicher Allgemeinheit und Portabilit?t. So realisiert diese Implementation die allgemeinste Form von Einbettungs-作者: Fabric 時間: 2025-3-22 15:28
Weicheng Qian,Kevin G. Stanley,Nathaniel D. Osgoodboth for polynomial-time and parameterized algorithms..Halldórsson?[SODA?1995] showed that for every . the . problem has a polynomial-time .-approximation algorithm in .-free graphs. We extend this result by showing that .-free graphs admit a polynomial-time .-approximation, where . is the size of a作者: urethritis 時間: 2025-3-22 17:25 作者: Rejuvenate 時間: 2025-3-22 23:38 作者: pericardium 時間: 2025-3-23 01:36
Joris Maervoet,Pascal Brackman,Katja Verbeeck,Patrick De Causmaecker,Greet Vanden Berghene to another. An instance of the problem consists of a capacitated directed network, in which vertices express their preferences over their incident edges. A network flow is stable if there is no group of vertices that all could benefit from rerouting the flow along a walk..Fleiner?[.] established 作者: Pigeon 時間: 2025-3-23 09:27 作者: surmount 時間: 2025-3-23 12:32 作者: Truculent 時間: 2025-3-23 17:41
Gavin McArdle,Ur?ka Dem?ar,Stefan van der Spek,Seán McLooneaph, using searchers; an edge is clear if it cannot contain the searched entity, contaminated otherwise. The . of a graph . is the smallest number of searchers required to “clear” .. A search strategy is . (.) if no recontamination ever occurs. It is . (.) if the set of clear edges always forms a co作者: 印第安人 時間: 2025-3-23 19:49 作者: FADE 時間: 2025-3-24 00:19 作者: 不朽中國 時間: 2025-3-24 03:38 作者: HEAVY 時間: 2025-3-24 06:35
André Sales Fonteles,Benedito J. A. Neto,Marcio Maia,Windson Viana,Rossana M. C. Andradebroadcasting (resp. gossiping), one node (resp. every node) has a piece of information and needs to transmit it to everyone else in the network. These communications patterns find their main applications in the field of interconnection networks for parallel architectures. In this paper, we are inter作者: 為敵 時間: 2025-3-24 12:30 作者: 態(tài)學(xué) 時間: 2025-3-24 15:44
Ali Tahir,Gavin McArdle,Michela Bertolottoding a path from . to . which uses none of the forbidden transitions of .. This means that it is forbidden for the path to consecutively use two edges forming a pair in?.. The study of this problem is motivated by routing in road networks in which forbidden transitions are associated to prohibited t作者: evasive 時間: 2025-3-24 22:43 作者: Admire 時間: 2025-3-24 23:46 作者: negligence 時間: 2025-3-25 03:57 作者: AMBI 時間: 2025-3-25 08:08 作者: 帶來 時間: 2025-3-25 14:27 作者: 使人入神 時間: 2025-3-25 15:53 作者: 啟發(fā) 時間: 2025-3-25 22:52 作者: 折磨 時間: 2025-3-26 04:00 作者: defibrillator 時間: 2025-3-26 05:54
Zhenlong Li,Chaowei Yang,Min Sun,Jing Li,Chen Xu,Qunying Huang,Kai Liuumber of visited neighbours. An MCS-ordering of a graph is an ordering of the vertices that can be generated by the Maximum Cardinality Search algorithm. The visited degree of a vertex . in an MCS-ordering is the number of neighbours of . that are before . in the ordering. The MCSLB of an MCS-orderi作者: 新陳代謝 時間: 2025-3-26 09:47
Hassan A. Karimi,Lei Zhang,Jessica G. Bennerownership and therefore discouraging piracy. Graph-based watermarking schemes comprise an encoding algorithm, which translates a given number (the identifier, usually a positive integer) onto some appropriately tailored graph (the watermark), and a decoding algorithm, which extracts the original ide作者: Pseudoephedrine 時間: 2025-3-26 15:05
Hassan A. Karimi,Lei Zhang,Jessica G. Bennerareas in which they may occur; among these areas are e.g. robotics, computer graphics, etc. One motion problem class recently being investigated is the ...The . is as follows: Given a set ?={P., ...,P.} of M n-vertex polygons in the Euclidean plane, with pairwise non-intersecting interiors. The poly作者: Madrigal 時間: 2025-3-26 17:39 作者: 松馳 時間: 2025-3-26 21:41
ependently without any knowledge of the network topology or size. Three communication tasks of increasing difficulty are studied. In . (BB) the goal is to communicate the source message to all nodes. In . (ABB) the goal is to achieve BB and inform the source about it. Finally, in . (FS) all nodes mu作者: 使習(xí)慣于 時間: 2025-3-27 04:53
Thomas C. van Dijk,Jan-Henrik Haunertbe represented as the edges of an undirected (multi)graph ., where an edge multiplicity larger than one corresponds to multiple copies of the same item. Each customer is interested in purchasing a bundle of edges of ., and we assume that each bundle forms a simple path in .. Each customer has a know作者: 鋼筆記下懲罰 時間: 2025-3-27 07:55
es ..,..., .. and . positive integers ..,..., .. such that ?.r.= ., there exist . node-disjoint paths of length at most . from . to the .., where .. of them end at ... This concept contains, and is related to, many important concepts used in communications and graph theory. The line digraph of a dig作者: cloture 時間: 2025-3-27 09:50 作者: stress-test 時間: 2025-3-27 15:30 作者: 釘牢 時間: 2025-3-27 18:52 作者: conjunctivitis 時間: 2025-3-27 23:40
Tour Suggestion for Outdoor Activitiestion. It generates valuable suggestions in the context of a web application. It is a promising method to generate candidate paths used by any local search algorithm, which further optimizes the solution.作者: flourish 時間: 2025-3-28 04:09 作者: 要控制 時間: 2025-3-28 06:18 作者: 殺死 時間: 2025-3-28 14:30
A Sensor Data Mediator Bridging the OGC Sensor Observation Service (SOS) and the OASIS Open Data Prot from each other, we propose a sensor data mediator solution and define an SOS entity data model for OData (SOS-OData) to bridge these two standards. Our prototype demonstrates that the proposed system can convert between existing SOS services and SOS-OData services. As a result, we can not only co作者: VICT 時間: 2025-3-28 16:46 作者: legitimate 時間: 2025-3-28 21:39
Dynamic Objects Effect on Visibility Analysis in 3D Urban Environmentsel in each time period from web source data and to analyze the environment. Dynamic objects prediction is based on validated models for driver behavior; pedestrians’ walking routes, trees’ displacement and wind effect. A real urban environment with dynamic objects approximated by 3D boxes and cylind作者: PANT 時間: 2025-3-29 00:07
Dynamic Objects Effect on Visibility Analysis in 3D Urban Environmentsel in each time period from web source data and to analyze the environment. Dynamic objects prediction is based on validated models for driver behavior; pedestrians’ walking routes, trees’ displacement and wind effect. A real urban environment with dynamic objects approximated by 3D boxes and cylind作者: 虛弱的神經(jīng) 時間: 2025-3-29 03:52 作者: Agnosia 時間: 2025-3-29 07:45 作者: 同音 時間: 2025-3-29 14:50 作者: DEVIL 時間: 2025-3-29 17:19
A High Performance Web-Based System for Analyzing and Visualizing Spatiotemporal Data for Climate St a high performance Web-based system for spatiotemporal data visual analytics includes the following components: 1) a Spatial Data Registration Center for managing the big spatiotemporal data and enabling researchers to focus on analyses without worrying about data related issues such as format, man作者: Respond 時間: 2025-3-29 21:11 作者: recession 時間: 2025-3-29 23:54
Thanh Thoa Pham Thi,Linh Truong-Hong,Junjun Yin,James D. Carswell388027.jpg作者: medium 時間: 2025-3-30 06:53
rse graph representations we demonstrate a high speed up of our proposed method over a traditional algorithm for graph edit distance computation and over two other sub-optimal approaches that use the Hungarian and Munkres algorithm. Also, we show that classification accuracy remains nearly unaffecte作者: Cumbersome 時間: 2025-3-30 09:38 作者: Radiculopathy 時間: 2025-3-30 16:15 作者: Melanocytes 時間: 2025-3-30 18:05 作者: Collision 時間: 2025-3-30 21:13
Weicheng Qian,Kevin G. Stanley,Nathaniel D. Osgoodrstellungen vgl. [I 1], [I 7]). Wir folgen hier in etwa der Darstellung in [I 2]. Es sei hier noch auf eine weitere Implementierung in [I 4] hingewiesen, die das in III.3 angegebene Syntaxanalyse-Verfahren für Graphen realisiert. Im letzten Abschnitt dieses Kapitels werden die zukünftigen Implementi作者: reception 時間: 2025-3-31 02:03 作者: FLORA 時間: 2025-3-31 05:15 作者: Intuitive 時間: 2025-3-31 12:14
Qiulei Guo,Jun Luo,Guiqing Li,Xin Wang,Nikolas Geroliminiss, a 2.445-approximation for perfect graphs, and a .-approximation for split graphs. To this end, we introduce a generic framework relying on a novel interpretation of BPC allowing us to solve the problem via . techniques. Our framework may find use in tackling BPC on other graph classes arising in 作者: Commonplace 時間: 2025-3-31 16:51
Joris Maervoet,Pascal Brackman,Katja Verbeeck,Patrick De Causmaecker,Greet Vanden Bergheraph transformation and based on this, we devise a simple and fast algorithm, which also can be used to find a solution to the stable marriage problem with forced and forbidden edges. Finally, we study the highly complex stable multicommodity flow model by Király and Pap?[.]. We present several grap作者: Inordinate 時間: 2025-3-31 19:00 作者: LVAD360 時間: 2025-3-31 22:55
Gavin McArdle,Ur?ka Dem?ar,Stefan van der Spek,Seán McLoone than implementing UBM in arbitrary topologies with free routing schemes. We then develop the Smart Centroid Algorithm, a polynomial time approximation algorithm which produces UBM calling schedules that are at most four times as long as the optimal UBM calling schedule for arbitrary topologies usin作者: Carcinoma 時間: 2025-4-1 04:01 作者: 國家明智 時間: 2025-4-1 08:13
Janne Kovanen,Tapani Sarjakoski,L. Tiina Sarjakoskiing the computation time at each node. For the . problem on UDGs, we present two local distributed algorithms with different tradeoffs between their approximation ratio and locality. The first algorithm has ratio 128 and locality 22, whereas the second algorithm has ratio 10 and locality 180.作者: Corral 時間: 2025-4-1 13:40 作者: 柔聲地說 時間: 2025-4-1 16:59 作者: 自負(fù)的人 時間: 2025-4-1 19:30
André Sales Fonteles,Benedito J. A. Neto,Marcio Maia,Windson Viana,Rossana M. C. Andradeaphs) which are Minimum Broadcast Graphs, Minimum Gossip Graphs, Minimum Linear Gossip Graphs and/or Minimum Broadcast Digraphs, and we show that in most cases, the proposed minimum graphs that can be found in the literature are Kn?del graphs [10,7].作者: 好忠告人 時間: 2025-4-2 01:35
Ali Tahir,Gavin McArdle,Michela Bertolotto a graph with no separating triangles. (iv) We exhibit an infinite family of simple optimal 2-plane graphs such that in any edge partition composed of a 1-plane graph and a plane graph, the plane graph has maximum vertex degree at least 6. (v) We show that every optimal 3-plane graph whose crossing-作者: Tremor 時間: 2025-4-2 06:37 作者: 放逐 時間: 2025-4-2 09:39
Chih-Yuan Huang,Steve Liang,Yan Xullows. Given an edge colored graph (here we allow ≥?2 colors) a trail (vertices may repeat but not edges) is called . when successive edges have different colors. Given a set of vertices called ., the . problem is to find an alternating trail connecting distinct terminals, if one exists. By reductio作者: Coronary 時間: 2025-4-2 14:37 作者: 和平主義者 時間: 2025-4-2 18:28 作者: Consensus 時間: 2025-4-2 19:52 作者: 積習(xí)已深 時間: 2025-4-3 02:12 作者: Functional 時間: 2025-4-3 04:02 作者: Gobble 時間: 2025-4-3 10:16 作者: concubine 時間: 2025-4-3 12:32
Zhenlong Li,Chaowei Yang,Min Sun,Jing Li,Chen Xu,Qunying Huang,Kai Liuarbor at least one Steiner minimal tree for . is called a . for . .,.. Particular interest attaches to Steiner hulls that are finitely generated in that they are determined by a finite subset . of . containing . and all Steiner points of some Steiner minimal tree for .; this finite set . can trivial
