Sciweavers

34 search results - page 4 / 7
» alenex 2007
Sort
View
ALENEX
2004
116views Algorithms» more  ALENEX 2004»
14 years 11 months ago
A Computational Framework for Handling Motion
We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...
Leonidas J. Guibas, Menelaos I. Karavelas, Daniel ...
80
Voted
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
14 years 11 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
75
Voted
ALENEX
2009
118views Algorithms» more  ALENEX 2009»
14 years 11 months ago
Solving Maximum Flow Problems on Real World Bipartite Graphs
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...
ALENEX
2009
115views Algorithms» more  ALENEX 2009»
14 years 11 months ago
Experimental comparison of the two Fredman-Khachiyan-algorithms
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
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
14 years 11 months ago
Intersection in Integer Inverted Indices
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
Peter Sanders, Frederik Transier