2638 search results - page 101 / 528 » Random Geometric Complexes |
151
click to vote
CCA
2009
Springer
15 years 11 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
137
click to vote
IM
2008
15 years 4 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
138
Voted
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
160
click to vote
VRST
2009
ACM
15 years 11 months ago
2009
ACM
Simulating crowds in complex environment is fascinating and challenging, however, modeling of the environment is always neglected in the past, which is one of the essential proble...
136
click to vote
EJC
2006
15 years 4 months ago
2006
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...