ALENEX 2007 | Sciweavers

9

ALENEX
2009

115views Algorithms» more ALENEX 2009»

Experimental comparison of the two Fredman-Khachiyan-algorithms

13 years 5 months ago

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 »

11

click to vote

ALENEX
2009

118views Algorithms» more ALENEX 2009»

Solving Maximum Flow Problems on Real World Bipartite Graphs

13 years 5 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 »

22

click to vote

ALENEX
2009

191views Algorithms» more ALENEX 2009»

Theory and Practise of Monotone Minimal Perfect Hashing

13 years 5 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 »

16

click to vote

ALENEX
2009

106views Algorithms» more ALENEX 2009»

Drawing Binary Tanglegrams: An Experimental Evaluation

13 years 5 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 »

11

click to vote

ALENEX
2009

107views Algorithms» more ALENEX 2009»

Tuning BNDM with q-Grams

13 years 5 months ago

Download www.dcs.kcl.ac.uk

Branislav Durian, Jan Holub, Hannu Peltola, Jorma ...

claim paper

Read More »

14

click to vote

ALENEX
2008

91views Algorithms» more ALENEX 2008»

How much Geometry it takes to Reconstruct a 2-Manifold in R3

13 years 5 months ago

Download www.stanford.edu

Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola...

claim paper

Read More »

21

click to vote

ALENEX
2008

192views Algorithms» more ALENEX 2008»

Compressed Inverted Indexes for In-Memory Search Engines

13 years 5 months ago

Download algo2.iti.kit.edu

We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...

Frederik Transier, Peter Sanders

claim paper

Read More »

17

click to vote

ALENEX
2003

173views Algorithms» more ALENEX 2003»

Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation

13 years 6 months ago

Download grid.tsinghua.edu.cn

John Hershberger, Matthew Maxel, Subhash Suri

claim paper

Read More »

14

click to vote

ALENEX
2003

137views Algorithms» more ALENEX 2003»

The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs

13 years 6 months ago

Download www.cc.gatech.edu

Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...

Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...

claim paper

Read More »

15

click to vote

ALENEX
2003

144views Algorithms» more ALENEX 2003»

Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries

13 years 6 months ago

Download www.charlierobbins.com

Ongoing changes in computer performance are aﬀecting the eﬃciency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...

Ranjan Sinha, Justin Zobel

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers