Distance oracles are data structures that provide fast (possibly approximate) answers to shortestpath and distance queries in graphs. The tradeoff between the space requirements and the query time of distance oracles is of particular interest and the main focus of this paper. In FOCS‘01, Thorup introduced approximate distance oracles for planar graphs. He proved that, for any > 0 and for any pl...

Various international bodies and non-governmental organizations (NGOs) have proposed guidelines for safeguarding biodiversity. Nevertheless, quantitative criteria for safeguarding biodiversity should first be established to measure the attainment of biodiversity conservation if biodiversity is to be safeguarded effectively. We conducted research on the impact of logging on biodiversity of dung ...

This paper proposes our approach to develop a system supporting visually impaired people with life-log. Visually impaired people face daily problems because of lack of information about road conditions. To find the uncomfortable and dangerous points, detecting their exceptional actions, such as tumbling down and getting lost, is effective. In the experiments, we used two units of iPod touch as ...

Detailed stratigraphic and structural features of the Giddings Brook slice of the Taconic Allochthon in the Granville area. This Field Trip Guide includes Road Log (pp. 222-226), and Outcrop/Stop Descriptions (pp. 227-242). pages 186-242 in: Friedman, G.M. (ed.) Guidebook, 51st N.Y. State Geol. Assoc. Ann. Mtg. and New England Intercollegiate Geol .Conf., 71st Mtg., Rensselaer Poly. Inst., Troy...

We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.