2012-01-01から1年間の記事一覧

A hub-based labeling algorithm for shortest paths in road networks

Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2011. A hub-based labeling algorithm for shortest paths in road networks. In Proceedings of the 10th international conference on Experimental algorithms (SEA'11), Pa…

Extremal Combinatorics

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science). Stasys Jukna.研究室輪読の準備中

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. 2008. Contraction hierarchies: faster and simpler hierarchical routing in road networks. In Proceedings of the 7th international conference on Experimental algorithms …

学振

(´Д`)ハァ… ceekz さん http://www.mibel.cs.tsukuba.ac.jp/~ceekz/dc1/ mamoruk さん http://cl.naist.jp/~komachi/docs/jsps.html togetter http://togetter.com/li/19460 科研費LaTeX http://osksn2.hep.sci.osaka-u.ac.jp/~taku/kakenhiLaTeX/index.html

Cache-oblivious priority queue and graph algorithm applications

Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, and J. Ian Munro. 2002. Cache-oblivious priority queue and graph algorithm applications. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (…

A memory efficient reachability data structure through bit vector compression

Sebastiaan J. van Schaik and Oege de Moor. 2011. A memory efficient reachability data structure through bit vector compression. In Proceedings of the 2011 international conference on Management of data (SIGMOD '11). ACM, New York, NY, USA,…

Efficient core decomposition in massive networks

James Cheng, Yiping Ke, Shumo Chu, and M. Tamer Ozsu. 2011. Efficient core decomposition in massive networks. In Proceedings of the 2011 IEEE 27th International Conference on Data Engineering (ICDE '11). IEEE Computer Society, Washington, …

大規模最短路問題に対するダイクストラ法の高速化

安井雄一郎、藤澤克樹、笹島啓史 (中央大学), 後藤和茂(マイクロソフト). 大規模最短路問題に対するダイクストラ法の高速化. 日本オペレーションズ・リサーチ学会和文論文誌.

Querying shortest path distance with bounded errors in large graphs

Miao Qiao, Hong Cheng, and Jeffrey Xu Yu. 2011. Querying shortest path distance with bounded errors in large graphs. In Proceedings of the 23rd international conference on Scientific and statistical database management (SSDBM'11), Judith B…

Scalable Graph Exploration on Multicore Processors

Virat Agarwal, Fabrizio Petrini, Davide Pasetto, and David A. Bader. 2010. Scalable Graph Exploration on Multicore Processors. In Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage…

Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme

Miao Qiao, Hong Cheng, Lijun Chang and Jeffrey Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", Accepted by the 2012 IEEE International Conference on Data Engineering (ICDE 12). 2012.

Finding Maximal k-Edge-Connected Subgraphs from a Large Graph

Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, weifa Liang, Baichen Chen, Jianxin Li, "Finding Maximal k-Edge-Connected Subgraphs from a Large Graph", EDBT'12.

Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach

Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach, James Cheng, Nanyang Technological University; Yiping Ke, The Chinese University of Hong Kong; Shumo Chu, Nanyang Technological University; Carter Cheng, Na…

GPS ロガー等

前回のスキーで RunKeeper で GPS ログをとってみたら結構楽しかったので,もう少し GPS ロガー等について調べた.スキーとかしてるときに GPS ログ取りたいというのと,旅行とかしてる時に GPS ログ取りたいというのを考えてる.スマホは iPhone.