128 search results - page 4 / 26 » A random walk approach to sampling hidden databases |
STACS
2009
Springer
15 years 4 months ago
2009
Springer
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
CN
2000
14 years 9 months ago
2000
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
AAAI
2008
14 years 12 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
TC
2008
14 years 9 months ago
2008
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...