Linear Time Algorithms for Finding Maximal Forward References

Las Vegas, Nevada April 28-April 30

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197519

International Conference on Informati ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Zhixiang Chen Articles by Richard H. Fowler Articles by Ada Wai-Chee Fu

	ASCII Text	x
	Zhixiang Chen, Richard H. Fowler, Ada Wai-Chee Fu, "Linear Time Algorithms for Finding Maximal Forward References," Information Technology: Coding and Computing, International Conference on, pp. 160, International Conference on Information Technology: Computers and Communications, 2003.

	BibTex	x
	@article{ 10.1109/ITCC.2003.1197519, author = {Zhixiang Chen and Richard H. Fowler and Ada Wai-Chee Fu}, title = {Linear Time Algorithms for Finding Maximal Forward References}, journal ={Information Technology: Coding and Computing, International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1916-4}, pages = {160}, doi = {http://doi.ieeecomputersociety.org/10.1109/ITCC.2003.1197519}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Information Technology: Coding and Computing, International Conference on TI - Linear Time Algorithms for Finding Maximal Forward References SN - 0-7695-1916-4 SP EP A1 - Zhixiang Chen, A1 - Richard H. Fowler, A1 - Ada Wai-Chee Fu, PY - 2003 KW - null VL - 0 JA - Information Technology: Coding and Computing, International Conference on ER -

Zhixiang Chen, University of Texas-Pan American

Richard H. Fowler, University of Texas-Pan American

Ada Wai-Chee Fu, Chinese University of Hong Kong

In this paper, two algorithms are designed for finding maximal forward references from very large Web logs, longest sequences of Web pages visited by a user without revisiting some previously visited page in the sequence, and their performance is comparatively analyzed. It is shown that the two algorithms have linear (hence optimal) time complexity.

Citation:

Zhixiang Chen, Richard H. Fowler, Ada Wai-Chee Fu, "Linear Time Algorithms for Finding Maximal Forward References," itcc, pp.160, International Conference on Information Technology: Computers and Communications, 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.