Sciweavers

    1139 search results - page 188 / 228
    » Bounded Ideation Theory
    Sort
    View
    STOC
    2009
    ACM
    144views Algorithms» more  STOC 2009»
    Homology flows, cohomology cuts
    14 years 8 months ago
    Homology flows, cohomology cuts
    Download  compgeom.cs.uiuc.edu
    We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
    Erin W. Chambers, Jeff Erickson, Amir Nayyeri
    claim paper
    Read More »
    KDD
    2009
    ACM
    163views Data Mining» more  KDD 2009»
    Large-scale graph mining using backbone refinement classes
    14 years 8 months ago
    Large-scale graph mining using backbone refinement classes
    Download  www.maunz.de
    We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
    Andreas Maunz, Christoph Helma, Stefan Kramer
    claim paper
    Read More »
    PODS
    2009
    ACM
    136views Database» more  PODS 2009»
    Distributed XML design
    14 years 8 months ago
    Distributed XML design
    Download  fox7.eu
    A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
    Serge Abiteboul, Georg Gottlob, Marco Manna
    claim paper
    Read More »
    MOBIHOC
    2009
    ACM
    258views Computer Networks» more  MOBIHOC 2009»
    Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels
    14 years 8 months ago
    Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels
    Download  decision.csl.illinois.edu
    Providing differentiated Quality of Service (QoS) over unreliable wireless channels is an important challenge for supporting several future applications. We analyze a model that h...
    I-Hong Hou, P. R. Kumar
    claim paper
    Read More »
    STOC
    2006
    ACM
    174views Algorithms» more  STOC 2006»
    Edge-disjoint paths in Planar graphs with constant congestion
    14 years 8 months ago
    Edge-disjoint paths in Planar graphs with constant congestion
    Download  www.cis.upenn.edu
    We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
    Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
    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-2024, USA.