274 search results - page 19 / 55 » On Random Sampling over Joins |
103
click to vote
ICRA
2002
IEEE
15 years 6 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
IM
2007
15 years 1 months ago
2007
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
138
click to vote
TMC
2011
14 years 8 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
232
click to vote
NLP
2000
15 years 5 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
213
click to vote
ICDE
2008
IEEE
16 years 3 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...