地名表
发表于 2025-3-28 17:55:43
http://reply.papertrans.cn/16/1529/152839/152839_41.png
Palter
发表于 2025-3-28 19:48:10
http://reply.papertrans.cn/16/1529/152839/152839_42.png
peritonitis
发表于 2025-3-29 01:45:19
Computing depth orders and related problems,a set of . convex and simply-shaped objects whose .-projections are all ‘fat’ and their sizes are within a constant ratio from one another, then a depth order for . can be computed in time ...) (.) log..), where . is the maximum number of intersections between the .-projections of the boundaries of any pair of objects in ..
演绎
发表于 2025-3-29 05:58:36
Selection in monotone matrices and computing ,, nearest neighbors,hbor of .. for every .; . is an appropriate constant. This algorithm is considerably faster than the one based on a row-selection algorithm for monotone matrices. If the points of . are arbitrary, then the .. nearest neighbor of .., for all ., can be computed in time .. log..), which also improves upon the previously best-known result.
medieval
发表于 2025-3-29 07:47:57
New on-line algorithms for the page replication problem,orm large classes of .-competitive algorithms for trees into 2.-competitive algorithms for rings. As a result we obtain a randomized on-line algorithm for rings that is 3.16-competitive. We also derive two 4-competitive on-line algorithms for rings which are either deterministic or memoryless.
TOM
发表于 2025-3-29 12:06:51
http://reply.papertrans.cn/16/1529/152839/152839_46.png
Inelasticity
发表于 2025-3-29 19:08:15
Separating translates in the plane: Combinatorial bounds and an algorithm,y orientation . (f is defined only by the “shape” of the translate). We also present an . log (.) time algorithm for finding a translate which can be separated from the maximum number of translates amongst sets of . pairwise disjoint translates of convex .-gons.
军械库
发表于 2025-3-29 22:22:28
http://reply.papertrans.cn/16/1529/152839/152839_48.png
不幸的人
发表于 2025-3-30 02:21:53
http://reply.papertrans.cn/16/1529/152839/152839_49.png
Matrimony
发表于 2025-3-30 06:29:56
Conference proceedings 1994Stockholm), and Ketan Mulmuley (Chicago). The contributions cover algorithms and data structures in all areas of computer science and in discrete mathematics, particularly including graph theory, computational geometry, and databases.