767 search results - page 38 / 154 » On Clustering Using Random Walks |
CN
2000
13 years 8 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 ...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Abstract. Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden informa...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
AINA
2008
IEEE
13 years 10 months ago
2008
IEEE
Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed t...
TAL
2010
Springer
13 years 6 months ago
2010
Springer
The lack of large-scale, freely available and durable lexical resources, and the consequences for NLP, is widely acknowledged but the attempts to cope with usual bottlenecks preven...