128 search results - page 9 / 26 » A random walk approach to sampling hidden databases |
172
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
There has been a recent resurgence of interest in research on noisy and incomplete data. Many applications require information to be recovered from such data. For example, in sens...
98
Voted
CVIU
2006
14 years 9 months ago
2006
We present algorithms for recognizing human motion in monocular video sequences, based on discriminative Conditional Random Field (CRF) and Maximum Entropy Markov Models (MEMM). E...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases,...
157
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
88
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...