Sciweavers

2004 search results - page 42 / 401
» Sampling from large graphs
Sort
View
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 12 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
AINA
2008
IEEE
15 years 6 months ago
Structure of the Thai Web Graph
This paper presents structural properties of the Thai Web graph. We conduct an empirical study on the Web graphs induced from two Thai web snapshots crawled during January 2007 (5...
Kulwadee Somboonviwat, Shinji Suzuki, Masaru Kitsu...
VLDB
1995
ACM
135views Database» more  VLDB 1995»
15 years 3 months ago
Sampling-Based Estimation of the Number of Distinct Values of an Attribute
We provide several new sampling-based estimators of the number of distinct values of an attribute in a relation. We compare these new estimators to estimators from the database an...
Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, L...
RECOMB
2007
Springer
16 years 2 days ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
ICMLA
2008
15 years 1 months ago
An Improved Generalized Discriminant Analysis for Large-Scale Data Set
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...
Weiya Shi, Yue-Fei Guo, Cheng Jin, Xiangyang Xue