최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회논문지. Journal of KIISE. 시스템 및 이론, v.37 no.1, 2010년, pp.27 - 34
김진일 (서울대학교 컴퓨터공학부) , 권유진 , 김진욱 (인하대학교 컴퓨터정보공학부) , 김성렬 (건국대학교 인터넷미디어공학부) , 박근수 (서울대학교 컴퓨터공학부)
Web crawlers are fundamental programs which iteratively download web pages by following links of web pages starting from a small set of initial URLs. Previously several web crawling orderings have been proposed to crawl popular web pages in preference to other pages, but some graph search techniques...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
J. Cho, H. Garcia-Molina, L. Page. Efficient crawling through URL ordering In Proceedings of 7th World Wide Web Conference, 1998.
J. Cho, H. Garcia-Molina, L. Page. Efficient crawling through URL ordering In Proceedings of 7th World Wide Web Conference, 1998.
S. Abiteboul, M. Preda, and G. Cobena. Adaptive On-Line Page Importance Computation. In WWW 2003, 2003.
P. Boldi, M. Santini, and S. Vigna. Do Your Worst to Make the Best: Paradoxical Effects in Page- Rank Incremental Computations. In International Workshop on Algorithms and Models for the Web-Graph (WAW), LNCS, vol.3, 2004.
R. Baeza-Yates, C. Castillo, M. Marin, and A. Rodriguez. Crawling a Country: Better Strategies than Breadth-First for Web Page Ordering. In A. Ellis and T. Hagino, editors WWW (Special interest tracks and posters) ACM, 2005.
R. E. Tarjan and M. Yannakakis. Simple lineartime algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13(3):566 579, Aug. 1984.
D. Corneil, R. Krueger, A unified view of graph searching, ICGT'05: Proceedings of 7th French International Colloquium on Graph Theory, Hyeres, France, 2005.
R. Krueger, Graph searching, PhD thesis, University of Toronto, 2005.
M. Habib, R. McConnell, C. Paul, L. Viennot, Lex- BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science, 234(1-2): 59-84, March 2000.
L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical report, Stanford Digital Library Technologies Project, Stanford University, Stanford, CA, USA, Nov. 1998.
J. Cho, U. Schonfeld. Rankmass crawler: a crawler with high personalized PageRank coverage guarantee. In VLDB Endowment, 2007.
S. Brin, L. Page, The anatomy of a large-scale hypertextual web search engine. In Proceeding of 7th World Wide Web Conference, 1998.
A. Berry, J. R. S. Blair, P. Heggernes, and B. W. Peyton. Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica, 39(4):287-298, 2004.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.