Sciweavers

23 search results - page 1 / 5
» On near-uniform URL sampling
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 8 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
JASIS
2010
170views more  JASIS 2010»
13 years 6 months ago
Analyzing URL queries
This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation and user click-through behavior was examined to determine the intent be...
Wei Meng Lee, Mark Sanderson
JASIS
2007
110views more  JASIS 2007»
13 years 7 months ago
Google Scholar citations and Google Web/URL citations: A multi-discipline exploratory analysis
In this paper we introduce a new data gathering method “Web/URL Citation” and use it and Google Scholar as a basis to compare traditional and Web-based citation patterns acros...
Kayvan Kousha, Mike Thelwall
CN
2000
109views more  CN 2000»
13 years 7 months ago
On near-uniform URL sampling
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 ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
13 years 11 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan