Search For:

Displaying 1-2 out of 2 total
Using Propagation of Distrust to Find Untrustworthy Web Neighborhoods
Found in: Internet and Web Applications and Services, International Conference on
By Panagiotis Metaxas
Issue Date:May 2009
pp. 516-521
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. But it is mainly a serious problem for web users because they tend to confuse t...
A parallel algorithm for computing minimum spanning trees
Found in: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures (SPAA '92)
By Donald B. Johnson, Panagiotis Metaxas
Issue Date:June 1992
pp. 363-372
We propose a new design for highly concurrent Internet services, which we call the staged event-driven architecture (SEDA). SEDA is intended to support massive concurrency demands and simplify the construction of well-conditioned services. In SEDA, applica...