Utilizing Geometric Anomalies of High Dimension: When Complexity Makes Computation Easier
Paul C. Kainen · Birkhäuser Boston eBooks · 1997
Just as a busy kitchen can be more efficient than an idle one, Kleinrock showed 35 years ago that heavily used networks admit simple heuristic approximations with excellent quantitative accuracy. We describe a number of different examples in which having many parameters actually facilitates computation and we suggest connections with geometric phenomena in high-dimensional spaces. It seems that in several interesting and quite general situations, dimensionality may be a blessing in disguise provided that some suitable form of computing is used which can deal with it.