2638 search results - page 111 / 528 » Random Geometric Complexes |
150
click to vote
EATCS
1998
15 years 4 months ago
1998
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
139
click to vote
CORR
2012
Springer
14 years 9 days ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
173
click to vote
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges beyond traditional random network model: op...
139
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
109
click to vote
VTC
2006
IEEE
15 years 10 months ago
2006
IEEE
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...