Sciweavers

    ALENEX
    2009
    115views Algorithms» more  ALENEX 2009»
    Experimental comparison of the two Fredman-Khachiyan-algorithms
    14 years 17 days ago
    Experimental comparison of the two Fredman-Khachiyan-algorithms
    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 »
    ALENEX
    2009
    118views Algorithms» more  ALENEX 2009»
    Solving Maximum Flow Problems on Real World Bipartite Graphs
    14 years 17 days ago
    Solving Maximum Flow Problems on Real World Bipartite Graphs
    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 »
    ALENEX
    2009
    191views Algorithms» more  ALENEX 2009»
    Theory and Practise of Monotone Minimal Perfect Hashing
    14 years 17 days ago
    Theory and Practise of Monotone Minimal Perfect Hashing
    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 »
    ALENEX
    2009
    106views Algorithms» more  ALENEX 2009»
    Drawing Binary Tanglegrams: An Experimental Evaluation
    14 years 17 days ago
    Drawing Binary Tanglegrams: An Experimental Evaluation
    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 »
    ALENEX
    2009
    107views Algorithms» more  ALENEX 2009»
    Tuning BNDM with q-Grams
    14 years 17 days ago
    Tuning BNDM with q-Grams
    Download  www.dcs.kcl.ac.uk
    Branislav Durian, Jan Holub, Hannu Peltola, Jorma ...
    claim paper
    Read More »
    ALENEX
    2008
    91views Algorithms» more  ALENEX 2008»
    How much Geometry it takes to Reconstruct a 2-Manifold in R3
    14 years 17 days ago
    How much Geometry it takes to Reconstruct a 2-Manifold in R3
    Download  www.stanford.edu
    Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola...
    claim paper
    Read More »
    ALENEX
    2008
    192views Algorithms» more  ALENEX 2008»
    Compressed Inverted Indexes for In-Memory Search Engines
    14 years 17 days ago
    Compressed Inverted Indexes for In-Memory Search Engines
    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 »
    ALENEX
    2003
    173views Algorithms» more  ALENEX 2003»
    Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation
    14 years 25 days ago
    Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation
    Download  grid.tsinghua.edu.cn
    John Hershberger, Matthew Maxel, Subhash Suri
    claim paper
    Read More »
    ALENEX
    2003
    137views Algorithms» more  ALENEX 2003»
    The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
    14 years 25 days ago
    The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
    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 »
    ALENEX
    2003
    144views Algorithms» more  ALENEX 2003»
    Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
    14 years 25 days ago
    Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
    Download  www.charlierobbins.com
    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
    claim paper
    Read More »
    1234next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.