3778 search results - page 572 / 756 » Representing Web Graphs |
132
click to vote
TON
2002
15 years 4 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
137
Voted
WWW
2007
ACM
16 years 5 months ago
2007
ACM
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 ...
153
click to vote
MM
2009
ACM
15 years 11 months ago
2009
ACM
In this paper, we exploit the problem of inferring images’ semantic concepts from community-contributed images and their associated noisy tags. To infer the concepts more accura...
152
Voted
RTSS
2007
IEEE
15 years 11 months ago
2007
IEEE
The increased complexity of performance-sensitive software systems leads to increased use of automated adaptation policies in lieu of manual performance tuning. Composition of ada...
162
click to vote
CCR
2002
15 years 4 months ago
2002
It has long been thought that the Internet, and its constituent networks, are hierarchical in nature. Consequently, the network topology generators most widely used by the Interne...