Sciweavers

    59 search results - page 4 / 12
    » soda 2003
    Sort
    View
    ICDAR
    2003
    IEEE
    136views Document Analysis» more  ICDAR 2003»
    Using tree-grammars for training set expansion in page classification
    13 years 10 months ago
    Using tree-grammars for training set expansion in page classification
    Download  www.dsi.unifi.it
    Stefano Baldi, Simone Marinai, Giovanni Soda
    claim paper
    Read More »
    HPDC
    2003
    IEEE
    110views Distributed And Parallel Com...» more  HPDC 2003»
    SODA: A Service-On-Demand Architecture for Application Service Hosting Utility Platforms
    13 years 10 months ago
    SODA: A Service-On-Demand Architecture for Application Service Hosting Utility Platforms
    Download  friends.cs.purdue.edu
    The Grid is realizing the vision of providing computation as utility: computation jobs can be scheduled on-demand in Grid hosts based on available computation capacity. In this pa...
    Xuxian Jiang, Dongyan Xu
    claim paper
    Read More »
    SODA
    2003
    ACM
    126views Algorithms» more  SODA 2003»
    The cover time of sparse random graphs
    13 years 6 months ago
    The cover time of sparse random graphs
    Download  www.dcs.kcl.ac.uk
    We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
    Colin Cooper, Alan M. Frieze
    claim paper
    Read More »
    SODA
    2003
    ACM
    121views Algorithms» more  SODA 2003»
    An improved approximation algorithm for the partial latin square extension problem
    13 years 6 months ago
    An improved approximation algorithm for the partial latin square extension problem
    Download  www.cs.cornell.edu
    Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
    Carla P. Gomes, Rommel G. Regis, David B. Shmoys
    claim paper
    Read More »
    SODA
    2003
    ACM
    127views Algorithms» more  SODA 2003»
    Binary space partitions for 3D subdivisions
    13 years 6 months ago
    Binary space partitions for 3D subdivisions
    Download  www.cs.ucsb.edu
    We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
    John Hershberger, Subhash Suri
    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.