Sciweavers

    214 search results - page 9 / 43
    » A linear time algorithm for L(2,1)-labeling of trees
    Sort
    View
    DCC
    2007
    IEEE
    90views Computer Graphics» more  DCC 2007»
    Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
    15 years 9 months ago
    Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
    Download  www.ssp.isee.kyushu-u.ac.jp
    We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
    Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...
    claim paper
    Read More »
    STOC
    1996
    ACM
    115views Algorithms» more  STOC 1996»
    Minimum Cuts in Near-Linear Time
    15 years 2 months ago
    Minimum Cuts in Near-Linear Time
    Download  www.cs.ust.hk
    We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
    David R. Karger
    claim paper
    Read More »
    CCCG
    2003
    109views Computational Geometry» more  CCCG 2003»
    Linear Binary Space Partitions and the Hierarchy of Object Classes
    14 years 11 months ago
    Linear Binary Space Partitions and the Hierarchy of Object Classes
    Download  web.cs.dal.ca
    We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
    Petr Tobola, Karel Nechvíle
    claim paper
    Read More »
    ALGORITHMICA
    2008
    52views more  ALGORITHMICA 2008»
    From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
    14 years 10 months ago
    From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
    Download  www.lirmm.fr
    We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
    V. Berry, Z. S. Peng, H. F. Ting
    claim paper
    Read More »
    EOR
    2008
    91views more  EOR 2008»
    A branch-and-bound algorithm for the linear ordering problem with cumulative costs
    14 years 10 months ago
    A branch-and-bound algorithm for the linear ordering problem with cumulative costs
    Download  www.crema.unimi.it
    The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
    Giovanni Righini
    claim paper
    Read More »
    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-2025, USA.