4377 search results - page 76 / 876 » Mass problems and randomness |
COMBINATORICA
2008
14 years 10 months ago
2008
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
FUIN
2002
14 years 9 months ago
2002
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
TIT
1998
14 years 9 months ago
1998
Abstract— We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process fXig
APPROX
2008
Springer
14 years 12 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...