7228 search results - page 111 / 1446 » From Algorithmic to Subjective Randomness |
127
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
116
Voted
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
150
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
121
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
158
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...