Sciweavers

128 search results - page 2 / 26
» A random walk approach to sampling hidden databases
Sort
View
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
13 years 7 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
14 years 7 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
BMCBI
2011
13 years 25 days ago
Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
Stefan Wolfsheimer, Inke Herms, Sven Rahmann, Alex...
INFOCOM
2010
IEEE
13 years 6 months ago
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athin...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 3 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki