Sciweavers

    TCS
    2016
    36views Theoretical Computer Science» more  TCS 2016»
    Minimizing average flow-time under knapsack constraint
    8 years 8 months ago
    Minimizing average flow-time under knapsack constraint
    Download  www.cse.iitd.ernet.in
    We give the first logarithmic approximation for minimizing average flow-time of jobs in the subset parallel machine setting (also called the restricted assignment setting) under...
    Suman Kalyan Bera, Syamantak Das, Amit Kumar 0001
    claim paper
    Read More »
    TCS
    2016
    48views Theoretical Computer Science» more  TCS 2016»
    Capacitated Max-Batching with interval graph compatibilities
    8 years 8 months ago
    Capacitated Max-Batching with interval graph compatibilities
    Download  1perc.net
    We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the cost of a clique is the maximum weight of any interval in...
    Tim Nonner
    claim paper
    Read More »
    TCS
    2016
    56views Theoretical Computer Science» more  TCS 2016»
    On competitive recommendations
    8 years 8 months ago
    On competitive recommendations
    Download  www.tik.ee.ethz.ch
    We are given an unknown binary matrix, where the entries correspond to preferences of users on items. We want to find at least one 1-entry in each row with a minimum number of que...
    Jara Uitto, Roger Wattenhofer
    claim paper
    Read More »
    TCS
    2016
    54views Theoretical Computer Science» more  TCS 2016»
    Hardness of computing width parameters based on branch decompositions over the vertex set
    8 years 8 months ago
    Hardness of computing width parameters based on branch decompositions over the vertex set
    Download  eurocomb2015.b.uib.no
    Many width parameters of graphs are defined using branch decompositions over the vertex set of the graph and a corresponding cut-function. In this paper, we give a general framew...
    Sigve Hortemo Sæther, Martin Vatshelle
    claim paper
    Read More »
    TCS
    2016
    83views Theoretical Computer Science» more  TCS 2016»
    Adaptive metric dimensionality reduction
    8 years 8 months ago
    Adaptive metric dimensionality reduction
    Download  www.wisdom.weizmann.ac.il
    Abstract. We study data-adaptive dimensionality reduction in the context of supervised learning in general metric spaces. Our main statistical contribution is a generalization boun...
    Lee-Ad Gottlieb, Aryeh Kontorovich, Robert Krauthg...
    claim paper
    Read More »
    TCS
    2016
    48views Theoretical Computer Science» more  TCS 2016»
    Unique parallel decomposition in branching and weak bisimulation semantics
    8 years 8 months ago
    Unique parallel decomposition in branching and weak bisimulation semantics
    Download  dl.ifip.org
    We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that totally normed behaviours always have parallel decompositions,...
    Bas Luttik
    claim paper
    Read More »
    TCS
    2016
    51views Theoretical Computer Science» more  TCS 2016»
    Order compression schemes
    8 years 8 months ago
    Order compression schemes
    Download  www2.cs.uregina.ca
    Sample compression schemes are schemes for “encoding” a set of examples in a small subset of examples. The long-standing open sample compression conjecture states that, for any...
    Malte Darnstädt, Thorsten Kiss, Hans Ulrich S...
    claim paper
    Read More »
    TCS
    2016
    47views Theoretical Computer Science» more  TCS 2016»
    A synthetic axiomatization of Map Theory
    8 years 8 months ago
    A synthetic axiomatization of Map Theory
    Download  www.diku.dk
    This paper presents a substantially simplified axiomatization of Map Theory and proves the consistency of this axiomatization (called MT) in ZFC under the assumption that there e...
    Chantal Berline, Klaus Grue
    claim paper
    Read More »
    TCS
    2016
    52views Theoretical Computer Science» more  TCS 2016»
    The number and degree distribution of spanning trees in the Tower of Hanoi graph
    8 years 8 months ago
    The number and degree distribution of spanning trees in the Tower of Hanoi graph
    Download  www-ma4.upc.edu
    The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synch...
    Zhongzhi Zhang, Shunqi Wu, Mingyun Li, Francesc Co...
    claim paper
    Read More »
    TCS
    2016
    45views Theoretical Computer Science» more  TCS 2016»
    Exact algorithms for weighted and unweighted Borda manipulation problems
    8 years 8 months ago
    Exact algorithms for weighted and unweighted Borda manipulation problems
    Download  www.ifaamas.org
    Yongjie Yang, Jiong Guo
    claim paper
    Read More »
    123next ›last »
    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.