ALENEX 2009 | Sciweavers

27

click to vote

ALENEX
2009

97views Algorithms» more ALENEX 2009»

Quasirandom Rumor Spreading: An Experimental Analysis

13 years 10 months ago

Download aeolus.ceid.upatras.gr

Benjamin Doerr, Tobias Friedrich, Marvin Künn...

claim paper

Read More »

43

click to vote

ALENEX
2009

172views Algorithms» more ALENEX 2009»

Rank Aggregation: Together We're Strong

13 years 10 months ago

Download itcs.tsinghua.edu.cn

We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...

Frans Schalekamp, Anke van Zuylen

claim paper

Read More »

32

click to vote

ALENEX
2009

115views Algorithms» more ALENEX 2009»

Experimental comparison of the two Fredman-Khachiyan-algorithms

14 years 1 months ago

Download www.minet.uni-jena.de

We experimentally compare the two algorithms A and B by Fredman and Khachiyan [FK96] for the problem Monet--given two monotone Boolean formulas in DNF and in CNF, decide whether ...

Matthias Hagen, Peter Horatschek, Martin Mundhenk

claim paper

Read More »

39

click to vote

ALENEX
2009

118views Algorithms» more ALENEX 2009»

Solving Maximum Flow Problems on Real World Bipartite Graphs

14 years 1 months ago

Download static.googleusercontent.com

In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...

Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...

claim paper

Read More »

55

click to vote

ALENEX
2009

191views Algorithms» more ALENEX 2009»

Theory and Practise of Monotone Minimal Perfect Hashing

14 years 1 months ago

Download vigna.dsi.unimi.it

Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...

Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...

claim paper

Read More »

45

click to vote

ALENEX
2009

106views Algorithms» more ALENEX 2009»

Drawing Binary Tanglegrams: An Experimental Evaluation

14 years 1 months ago

Download www.win.tue.nl

A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...

Martin Nöllenburg, Markus Völker, Alexan...

claim paper

Read More »

28

click to vote

ALENEX
2009

107views Algorithms» more ALENEX 2009»

Tuning BNDM with q-Grams

14 years 1 months ago