Sciweavers

    709 search results - page 83 / 142
    » On LR(k)-Parsers of Polynomial Size
    Sort
    View
    ESA
    2008
    Springer
    153views Algorithms» more  ESA 2008»
    A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
    14 years 11 months ago
    A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
    Download  www.dis.uniroma1.it
    We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
    Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...
    claim paper
    Read More »
    ESA
    2008
    Springer
    129views Algorithms» more  ESA 2008»
    More Robust Hashing: Cuckoo Hashing with a Stash
    14 years 11 months ago
    More Robust Hashing: Cuckoo Hashing with a Stash
    Download  www.eecs.harvard.edu
    Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there...
    Adam Kirsch, Michael Mitzenmacher, Udi Wieder
    claim paper
    Read More »
    ICWSM
    2008
    141views Internet Technology» more  ICWSM 2008»
    Discovering Relationships among Tags and Geotags
    14 years 11 months ago
    Discovering Relationships among Tags and Geotags
    Download  imsc-dmim.usc.edu
    This paper presents an analysis of the correlation of annotated information unit (textual) tags and geographical identification metadata geotags. In this paper, to make it possibl...
    Sang Su Lee, Dongwoo Won, Dennis McLeod
    claim paper
    Read More »
    NIPS
    2007
    115views Information Technology» more  NIPS 2007»
    Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing
    14 years 11 months ago
    Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing
    Download  people.csail.mit.edu
    In this paper we formulate a novel AND/OR graph representation capable of describing the different configurations of deformable articulated objects such as horses. The representa...
    Yuanhao Chen, Long Zhu, Chenxi Lin, Alan L. Yuille...
    claim paper
    Read More »
    SODA
    2004
    ACM
    152views Algorithms» more  SODA 2004»
    Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
    14 years 11 months ago
    Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
    Download  ems.calumet.purdue.edu
    Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
    Artur Czumaj, Michelangelo Grigni, Papa Sissokho, ...
    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.