Author: Charu C. Aggarwal

Publication Overview

Publication period start: 2001
Number of co-authors: 4

Co-Authors

Number of publications with favourite co-authors

Productive Colleagues

Most productive colleagues in number of publications

Publications

Aggarwal, Charu C., Al-Garawi, Fatima, Yu, Philip S. (2001): On the design of a learning crawler for topical resource discovery. In ACM Transactions on Information Systems, 19 (3) pp. 286-309. https://dl.acm.org/doi/10.1145/502115.502119
Aggarwal, Charu C., Sun, Zheng, Yu, Philip S. (1998): Online Algorithms for Finding Profile Association Rules. In: Gardarin, Georges, French, James C., Pissinou, Niki (eds.) Proceedings of the 1998 ACM CIKM International Conference on Information and Knowledge Management November 3-7, 1998, Bethesda, Maryland, USA. pp. 86-95. https://doi.acm.org/10.1145/288627.288644
Aggarwal, Charu C., Yu, Philip S. (1997): On Disk Caching of Web Objects in Proxy Servers. In: Golshani, Forouzan, Makki, Kia (eds.) Proceedings of the Sixth International Conference on Information and Knowledge Management CIKM97 November 10-14, 1997, Las Vegas, Nevada. pp. 238-245. https://doi.acm.org/10.1145/266714.266904
Kim, Sang-Wook, Aggarwal, Charu C., Yu, Philip S. (2001): Effective Nearest Neighbor Indexing with the Euclidean Metric. In: Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management November 5-10, 2001, Atlanta, Georgia, USA. pp. 9-16. https://
Aggarwal, Charu C., Al-Garawi, Fatima, Yu, Philip S. (2001): Intelligent crawling on the World Wide Web with arbitrary predicates. In: Proceedings of the 2001 International Conference on the World Wide Web , 2001, . pp. 96-105. https://doi.acm.org/10.1145/371920.371955
Privacy Settings
By using this site, you accept our Cookie Policy and Terms of Use.
Customize
Accept all

Feel Stuck? Want Freedom?

Join 326,664+ designers who get one powerful email each week. Learn to design a life you love.

Next email in
0
days
14
hrs
22
mins
53
secs

Free forever. No spam. Unsubscribe anytime.