DEFT
发表于 2025-3-26 21:07:39
http://reply.papertrans.cn/16/1532/153155/153155_31.png
变色龙
发表于 2025-3-27 04:11:28
Armando Häring,Thomas Klein,Kristian StoyeFredman and Saks have proved a Ω(log ./log log .) amortized time lower bound for two problems, List Indexing and Subset Rank, in the cell probe model with logarithmic word size. This paper gives algorithms for both problems that achieve the lower bound on a RAM with logarithmic word size.
Foolproof
发表于 2025-3-27 05:39:45
Björn Schneider Diplom-SoziologeLet p and q be a pair of points in a set S of N points in the plane. Let d(p,q) be the Euclidean distance between p and q and let DT(p,q) be the length of the shortest path from p to q in the Delaunay triangulation of S. We show that that the ratio . independent of S and N.
镇压
发表于 2025-3-27 11:06:10
http://reply.papertrans.cn/16/1532/153155/153155_34.png
LUDE
发表于 2025-3-27 14:22:16
Optimal algorithms for List Indexing and Subset Rank,Fredman and Saks have proved a Ω(log ./log log .) amortized time lower bound for two problems, List Indexing and Subset Rank, in the cell probe model with logarithmic word size. This paper gives algorithms for both problems that achieve the lower bound on a RAM with logarithmic word size.
伟大
发表于 2025-3-27 20:50:20
http://reply.papertrans.cn/16/1532/153155/153155_36.png
figment
发表于 2025-3-28 01:16:50
http://reply.papertrans.cn/16/1532/153155/153155_37.png
青春期
发表于 2025-3-28 05:58:42
http://reply.papertrans.cn/16/1532/153155/153155_38.png
幼儿
发表于 2025-3-28 10:05:36
http://reply.papertrans.cn/16/1532/153155/153155_39.png
ostensible
发表于 2025-3-28 11:06:48
On the performance of orthogonal range queries in multiattribute and doubly chained trees,we study the effect of page size variation in a paginated tree. We show that pagination may decrease the search cost, but is liable to raise the access cost in considerable proportion with respect to the cost on a non paginated tree.