Sciweavers

    175 search results - page 29 / 35
    » Approximation Algorithms for Flexible Job Shop Problems
    Sort
    View
    SODA
    2008
    ACM
    185views Algorithms» more  SODA 2008»
    Better bounds for online load balancing on unrelated machines
    13 years 9 months ago
    Better bounds for online load balancing on unrelated machines
    Download  www.ceid.upatras.gr
    We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
    Ioannis Caragiannis
    claim paper
    Read More »
    ICDE
    2009
    IEEE
    135views Database» more  ICDE 2009»
    Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
    14 years 9 months ago
    Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
    Download  www.jiahenglu.net
    Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
    Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
    claim paper
    Read More »
    PAMI
    2011
    346views Operations Research» more  PAMI 2011»
    Approximately Global Optimization for Robust Alignment of Generalized Shapes
    13 years 2 months ago
    Approximately Global Optimization for Robust Alignment of Generalized Shapes
    Download  www.lehigh.edu
    —In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
    Hongsheng Li, Tian Shen, Xiaolei Huang
    claim paper
    Read More »
    MEMICS
    2010
    172views Theoretical Computer Science» more  MEMICS 2010»
    A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
    13 years 2 months ago
    A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
    Download  drops.dagstuhl.de
    In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
    Ondrej Danek, Martin Maska
    claim paper
    Read More »
    JCC
    2006
    110views more  JCC 2006»
    Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
    13 years 7 months ago
    Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
    Download  www.remo-rohs.de
    : This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
    Heinz Sklenar, Daniel Wüstner, Remo Rohs
    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.