Sciweavers

96 search results - page 18 / 20
» On the scaling of congestion in the internet graph
Sort
View
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
WWW
2011
ACM
13 years 2 months ago
Finding hierarchy in directed online social networks
Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarch...
Mangesh Gupte, Pravin Shankar, Jing Li, S. Muthukr...
WWW
2011
ACM
13 years 2 months ago
Improving recommendation for long-tail queries via templates
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
Idan Szpektor, Aristides Gionis, Yoelle Maarek
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
14 years 8 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
GLOBECOM
2006
IEEE
14 years 1 months ago
Scalable Hierarchical Traceback
—Distributed Denial of Service attacks have recently emerged as one of the most potent, if not the greatest, weaknesses of the Internet. Previous solutions for this problem try t...
Arjan Durresi, Vamsi Paruchuri