Sciweavers

    1341 search results - page 261 / 269
    » Periods in Extensions of Words
    Sort
    View
    ISCA
    2002
    IEEE
    174views Hardware» more  ISCA 2002»
    Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
    13 years 7 months ago
    Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
    Download  cs.ua.edu
    In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
    Sibabrata Ray, Hong Jiang
    claim paper
    Read More »
    JCB
    2002
    116views more  JCB 2002»
    A Novel Approach to Remote Homology Detection: Jumping Alignments
    13 years 7 months ago
    A Novel Approach to Remote Homology Detection: Jumping Alignments
    Download  compdiag.molgen.mpg.de
    We describe a new algorithm for protein classi cation and the detection of remote homologs. The rationale is to exploit both vertical and horizontal information of a multiple alig...
    Rainer Spang, Marc Rehmsmeier, Jens Stoye
    claim paper
    Read More »
    JIRS
    1998
    100views more  JIRS 1998»
    Reactive Robots in the Service of Production Management
    13 years 7 months ago
    Reactive Robots in the Service of Production Management
    Download  users.softlab.ece.ntua.gr
    In this paper, we advocate the use of reactive robots in industrial process control and production management. It is explained why reactive robots are well-suited to modern industr...
    Elpida Tzafestas
    claim paper
    Read More »
    SIAMCOMP
    1998
    114views more  SIAMCOMP 1998»
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
    13 years 7 months ago
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
    Download  www.math.tu-berlin.de
    A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
    Stefan Felsner, Lorenz Wernisch
    claim paper
    Read More »
    SIAMCOMP
    1998
    118views more  SIAMCOMP 1998»
    Genericity, Randomness, and Polynomial-Time Approximations
    13 years 7 months ago
    Genericity, Randomness, and Polynomial-Time Approximations
    Download  coitweb.uncc.edu
    Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
    Yongge Wang
    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.