A content-aware multimedia accessing model in ad hoc networks

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 1, Issue , 2005, Pages 613-619

  Yang, Bo ^a   Hurson, Ali R ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; MULTIMEDIA ACCESSING MODELS; MULTIMEDIA RETRIEVAL; SUMMARY-SCHEMAS MODELS (SSM);

COMPUTATIONAL COMPLEXITY; DATA PROCESSING; DATA REDUCTION; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; MULTIMEDIA SYSTEMS; SEMANTICS; TOPOLOGY;

TELECOMMUNICATION NETWORKS;

EID: 23944493641     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2005.14     Document Type: Conference Paper

References (18)

1. C. E. Perkins, E. M. Royer, S. R. Das, M. K. Marina. Performance comparison of two on-demand routing protocols for ad hoc networks. IEEE Personal Communications, 2001, 8(1): 16-28.
2. H. Samet. The Quadtree and related hierarchical data structures. ACM computing surveys, 1984, 16(2): 187-260.
3. A. W. Fu, P. M. Chan, Y. Cheung, and Y. S. Moon. Dynamic VP-tree indexing for n-nearest neighbor search given pair-wise distances. VLDB Journal, 2000, 9(2): 154-173.
4. J. B. Kim and H. J. Kim. Unsupervised moving object segmentation and recognition using clustering and a neural network. Proceedings of the 2002 International Joint Conference on neural networks (IJCNN '02), 2002, 2: 1240-1245.
5. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles, Conference on Management of data, 1990, 19(2): 322-331.
6. N. Katayama, S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries, conference on Management of data, 1997, 26(2): 369-380.
7. J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. ACM Mobicom, 1998: 85-97.
8. M. Thottan, V. Mirrokni, H. Uzunalioglu, and S. Paul. A simple polynomial time framework for reduced path decomposition in multi-path routing. IEEE Infocom, 2004.
9. M. W. Bright, A. R. Hurson, and S. Pakzad. Automated Resolution of Semantic Heterogeneity in Multidatabases. ACM Transactions on Database Systems, 1994, 19(2): 212-253.
10. G. Auffret, J. Foote, C. Li, B. Shahraray, T. Syeda-Mahmood, and H. Zhang. Multimedia access and retrieval: The state of the art and future directions, Conference on multimedia, 1999, pp: 443-445.
11. E. M. Royer and C. E. Perkins. An implementation study of the AODV routing protocol. IEEE Wireless Communications and Networking Conference, 2000.
12. T. Guven, C. Kommareddy, R. La, M. Shayman, and S. Measurement based Optimal multi-path routing, IEEE Infocom, 2004.
13. G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs, SIAM-ACM Symposium on Discrete Algorithms (SODA), 2000: 770-779.
14. Maurice Karnaugh. The map method for synthesis of combinational logic circuits. Trans. AIEE. Part I, 1953, 72(9): 593-599.
15. Paul Viola and Michael Jones. Robust real-time object detection. International Journal of Computer Vision, 2001.
16. P. F. Felzenszwalb and D. P. Huttenlocher. Efficient matching of pictorial structure. IEEE Conference on Computer Vision and Pattern Recognition, 2000: 66-73.
17. S. Ioffe and D. Forsyth. Human tracking with mixture of trees. IEEE International Conference on Computer Vision, 2001(1): 690-697.
18. S. Mahamud, M. Hebert, and J. Lafferty. Combining Simple Discriminators for Object Discrimination. European Conference on Computer Vision, 2002.