Titlebook: Experimental Algorithms; 13th International S Joachim Gudmundsson,Jyrki Katajainen Conference proceedings 2014 Springer International Publi

影響

Cumbersome

挑剔為人

Loop Nesting Forests, Dominators, and Applicationsareas. In this work we first present carefully engineered implementations of efficient algorithms for computing a loop nesting forest of a given directed graph, including a very efficient algorithm that computes the forest in a single depth-first search. Then we revisit the problem of computing domi

GENUS

DenseZDD: A Compact and Fast Index for Families of Setsndamental techniques for web information retrieval, integration, and mining. For this purpose, a special type of ., called ., is used. However, current techniques for storing ZDDs require a huge amount of memory and membership operations are slow. This paper introduces DenseZDD, a compressed index f

MARS

An Evaluation of Dynamic Labeling Schemes for Tree Networkscheme that converts static labeling schemes to dynamic, and a specialized dynamic distance labeling scheme. Our study shows that theoretical bounds only partially portray the performance of such dynamic labeling schemes in practice. First, we observe order-of-magnitude differences between the gains

吞下

sperse

Computing Consensus Curvesough there are many generic software tools for motion tracking and specific ones for insect tracking, even untrained humans are better at this task. We consider several local (one ant at a time) and global (all ants together) methods. Our best performing algorithm uses a novel global method, based o

CLASH

Selecting Data for Experiments: Past, Present and Futured be based on active discussions with users and careful study of existing data. Selecting data to model problems that may arise in the . is the most interesting and delicate of the tasks that we will consider.

eulogize

cortisol

Efficient Wavelet Tree Construction and Querying for Multicore Architecturesre algorithms for wavelet tree construction that run in .(.) time using . processors, where . is the size of the input and . the alphabet size. Both algorithms have efficient memory consumption. We also present a querying technique based on batch processing that improves on simple domain-decomposition techniques.