Sciweavers

2004 search results - page 16 / 401
» Sampling from large graphs
Sort
View
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 4 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
ISCSCT
2008
IEEE
15 years 6 months ago
Large Scale Scenes Reconstruction from Multiple Views
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
Limin Shi, Feng Zhang, Zhenhui Xu, Zhanyi Hu
IDA
2011
Springer
14 years 6 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
WSCG
2004
143views more  WSCG 2004»
15 years 1 months ago
View Dependent Stochastic Sampling for Efficient Rendering of Point Sampled Surfaces
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
Sushil Bhakar, Liang Luo, Sudhir P. Mudur
ICDCS
2007
IEEE
15 years 6 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta