A cell probe lower bound for dynamic nearest-neighbour searching

被引：0

作者：

Alstrup, S ^{[1
]}

Husfeldt, T ^{[1
]}

Rauhe, T ^{[1
]}

机构：

[1] Univ Copenhagen, IT, DK-2400 Copenhagen NV, Denmark

来源：

PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2001年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：779 / 780

页数：2

共 50 条

[1] An optimal randomised cell probe lower bound for approximate nearest neighbour searching
Chakrabarti, A
Regev, O
45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 473 - 482
[2] An improved algorithm for dynamic nearest-neighbour models
Mocnik, Franz-Benjamin
JOURNAL OF SPATIAL SCIENCE, 2022, 67 (03) : 411 - 438
[3] AN OPTIMAL RANDOMIZED CELL PROBE LOWER BOUND FOR APPROXIMATE NEAREST NEIGHBOR SEARCHING
Chakrabarti, Amit
Regev, Oded
SIAM JOURNAL ON COMPUTING, 2010, 39 (05) : 1919 - 1940
[4] Properties of nearest-neighbour classifiers
Hall, Peter
Contributions to Probability and Statistics: Applications and Challenges, 2006, : 300 - 300
[5] Dynamics of Nearest-Neighbour Competitions on Graphs
Tonguç Rador
Journal of Statistical Physics, 2017, 169 : 265 - 302
[6] Nearest-neighbour modelling of reciprocal chains
Carravetta, Francesco
STOCHASTICS-AN INTERNATIONAL JOURNAL OF PROBABILITY AND STOCHASTIC PROCESSES, 2008, 80 (06) : 525 - 584
[7] Tree arbiter with nearest-neighbour scheduling
Mitrani, I
Yakovlev, A
ADVANCES IN COMPUTER AND INFORMATION SCIENCES '98, 1998, 53 : 83 - 92
[8] Approximative fast nearest-neighbour recognition
Miclet, L.
Dabouz, M.
PATTERN RECOGNITION LETTERS, 1983, 1 (5-6) : 277 - 285
[9] Dynamics of Nearest-Neighbour Competitions on Graphs
Rador, Tonguc
JOURNAL OF STATISTICAL PHYSICS, 2017, 169 (02) : 265 - 302
[10] Multi-functional nearest-neighbour classification
Qu, Yanpeng
Shang, Changjing
Mac Parthalain, Neil
Wu, Wei
Shen, Qiang
SOFT COMPUTING, 2018, 22 (08) : 2717 - 2730

← 1 2 3 4 5 →