Sciweavers

96 search results - page 16 / 20
» On the scaling of congestion in the internet graph
Sort
View
WWW
2007
ACM
14 years 8 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
WWW
2007
ACM
14 years 8 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
WWW
2007
ACM
14 years 8 months ago
Finding community structure in mega-scale social networks: [extended abstract]
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...
Ken Wakita, Toshiyuki Tsurumi
WWW
2005
ACM
14 years 8 months ago
G-ToPSS: fast filtering of graph-based metadata
RDF is increasingly being used to represent metadata. RDF Site Summary (RSS) is an application of RDF on the Web that has considerably grown in popularity. However, the way RSS sy...
Milenko Petrovic, Haifeng Liu, Hans-Arno Jacobsen
WWW
2011
ACM
13 years 2 months ago
Predicting popular messages in Twitter
Social network services have become a viable source of information for users. In Twitter, information deemed important by the community propagates through retweets. Studying the c...
Liangjie Hong, Ovidiu Dan, Brian D. Davison