Efficient stack distance computation for priority replacement policies

被引：0

作者：

Dep. Information Engineering, Università di Padova, Padova, Italy ^{[1
]}

不详 ^{[2
]}

机构：

来源：

Proc. ACM Int. Conf. Comput. Front., CF |

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Trees (mathematics)

引用

共 50 条

[41] On-Stack Replacement, Distilled
D'Elia, Daniele Cono
Demetrescu, Camil
ACM SIGPLAN NOTICES, 2018, 53 (04) : 166 - 180
[42] On-Stack Replacement, Distilled
D'Elia, Daniele Cono
Demetrescu, Camil
PROCEEDINGS OF THE 39TH ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, PLDI 2018, 2018, : 166 - 180
[43] EFFICIENT METHODS FOR CALCULATING THE SUCCESS FUNCTION OF FIXED SPACE REPLACEMENT POLICIES
OLKEN, F
PERFORMANCE EVALUATION, 1983, 3 (02) : 153 - 154
[44] An efficient tree-based computation of a metric comparable to a natural diffusion distance
Goldberg, Maxim J.
Kim, Seonja
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2012, 33 (02) : 261 - 281
[45] HGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation
Kim, Jongik
IEEE ACCESS, 2020, 8 : 175776 - 175787
[46] Accelerating computation of Euclidean distance map using the GPU with efficient memory access
Man, Duhu
Uda, Kenji
Ito, Yasuaki
Nakano, Koji
INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2013, 28 (05) : 383 - 406
[47] Efficient computation of face shape similarity using distance transform eigendecomposition and valleys
Pujol, A
Villanueva, JJ
Alba, JL
2001 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL I, PROCEEDINGS, 2001, : 1030 - 1033
[48] An Efficient Pre-computation Technique for Approximation Distance Query in Road Networks
Fu, Qiang
Sun, Guangzhong
Zhang, Zhong
2013 IEEE 14TH INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT (MDM 2013), VOL 2, 2013, : 131 - 135
[49] Efficient computation of the Euclidean distance transform (vol 80, pg 379, 2000)
Boxer, L
Miller, R
COMPUTER VISION AND IMAGE UNDERSTANDING, 2002, 86 (02) : 137 - 140
[50] Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs
Manuel Then
Stephan Günnemann
Alfons Kemper
Thomas Neumann
Datenbank-Spektrum, 2017, 17 (2) : 169 - 182

← 1 2 3 4 5 →