128 search results - page 7 / 26 » A random walk approach to sampling hidden databases |
174
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
An ever increasing amount of valuable information is stored in Web databases, "hidden" behind search interfaces. To save the user's effort in manually exploring eac...
PKDD
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, a method for automatic classification of Hidden-Web databases is addressed. In our approach, the classification tree for Hidden Web databases is constructed by tailo...
70
Voted
VLDB
1992
ACM
15 years 1 months ago
1992
ACM
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
116
click to vote
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...