MULTIDIMENSIONAL TREES, RANGE SEARCHING, AND A CORRELATION DIMENSION ALGORITHM OF REDUCED COMPLEXITY

被引：34

作者：

BINGHAM, S

KOT, M

机构：

来源：

PHYSICS LETTERS A | 1989年 / 140卷 / 06期

关键词：

D O I：

10.1016/0375-9601(89)90629-4

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

引用

页码：327 / 330

页数：4

共 17 条

[1] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].

BENTLEY, JL .

COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517

[2]

BINGHAM SC, UNPUB EFFICIENT ALGO

[3] PREDICTING CHAOTIC TIME-SERIES [J].

FARMER, JD ;

SIDOROWICH, JJ .

PHYSICAL REVIEW LETTERS, 1987, 59 (08) :845-848

[4] MEASURING THE STRANGENESS OF STRANGE ATTRACTORS [J].

GRASSBERGER, P ;

PROCACCIA, I .

PHYSICA D, 1983, 9 (1-2) :189-208

[5] CHARACTERIZATION OF STRANGE ATTRACTORS [J].

GRASSBERGER, P ;

PROCACCIA, I .

PHYSICAL REVIEW LETTERS, 1983, 50 (05) :346-349

[6] IMPRACTICALITY OF A BOX-COUNTING ALGORITHM FOR CALCULATING THE DIMENSIONALITY OF STRANGE ATTRACTORS [J].

GREENSIDE, HS ;

WOLF, A ;

SWIFT, J ;

PIGNATARO, T .

PHYSICAL REVIEW A, 1982, 25 (06) :3453-3456

[7] 2-DIMENSIONAL MAPPING WITH A STRANGE ATTRACTOR [J].

HENON, M .

COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1976, 50 (01) :69-77

[8]

Knuth D.E., 1973, ART COMPUTER PROGRAM, VI

[9]

KOT M, UNPUB CHAOS FORCED D

[10]

Mandelbrot B. B, 1983, AMJPHYS

← 1 2 →