Mobile Intelligence

REFERENCES

1. P. K. Agarwal, L. Arge, and F. Erickson. Indexing moving points. J. Comput. Syst. Sci., 66(1):207–243, 2003.

2. P. K. Agarwal, L. Arge, F. Erickson, P. G. Franciosa, and J. S. Vitter. Efficient searching with linear constraints. J. Comput. Syst. Sci., 61(2):194–216, 2000.

3. P. K. Agarwal, L. Arge, and J. Vahrenhold. Time responsive external data structures for moving points. In Proceedings of the International Workshop on Distributed Algorithms and Data Structures (WADS), Vol. 2125, Lecture Notes in Computer Science, pp. 50–61, 2001.

4. C. C. Aggarwal and D. Agrawal. On nearest neighbor indexing of nonlinear trajectories. In Proceedings of the ACM Symposium on Principles Of Database Systems (PODS), pp. 252–259, 2003.

5. A. Apostolico and G. Bejerano. Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. J. Comput. Bio., 7(3–4):381–393, 2000.

6. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 322–331, 1990.

7. R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis. Nearest neighbor and reverse nearest neighbor queries for moving objects. Very Large Data Bases J., 15(3):229–250, 2006.

8. A. Bhattacharya and S. K. Das. LeZi-Update: an information-theoretic framework for personal mobility tracking in PCS networks. ACM/Kluwer Wireless Networks, 8(2–3):121–135, ...