Sciweavers

4526 search results - page 615 / 906
» Algorithmic problems related to the Internet
Sort
View
SIGCOMM
2005
ACM
16 years 8 days ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...
APWEB
2005
Springer
16 years 8 days ago
Mining Quantitative Associations in Large Database
Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to mak...
Chenyong Hu, Yongji Wang, Benyu Zhang, Qiang Yang,...
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
16 years 4 days ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
WIDM
2004
ACM
16 years 4 days ago
Probabilistic models for focused web crawling
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
Hongyu Liu, Evangelos E. Milios, Jeannette Janssen
WIDM
2004
ACM
16 years 4 days ago
XPath lookup queries in P2P networks
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
Angela Bonifati, Ugo Matrangolo, Alfredo Cuzzocrea...