Sciweavers

    TCS
    2016
    65views Theoretical Computer Science» more  TCS 2016»
    Computing maximal cliques in link streams
    8 years 10 days ago
    Computing maximal cliques in link streams
    Download  www-complexnetworks.lip6.fr
    A link stream is a collection of triplets (t, u, v) indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to s...
    Jordan Viard, Matthieu Latapy, Clémence Mag...
    claim paper
    Read More »
    TCS
    2016
    65views Theoretical Computer Science» more  TCS 2016»
    On 2-protected nodes in random digital trees
    8 years 10 days ago
    On 2-protected nodes in random digital trees
    Download  jupiter.math.nctu.edu.tw
    In this paper, we consider the number of 2-protected nodes in random digital trees. Results for the mean and variance of this number for tries have been obtained by Gaither, Homma...
    Michael Fuchs 0001, C.-K. Lee, G.-R. Yu
    claim paper
    Read More »
    TCS
    2016
    54views Theoretical Computer Science» more  TCS 2016»
    Changing of the guards: Strip cover with duty cycling
    8 years 10 days ago
    Changing of the guards: Strip cover with duty cycling
    Download  www.math.smith.edu
    The notion of duty cycling is common in problems which seek to maximize the lifetime of a wireless sensor network. In the duty cycling model, sensors are grouped into shifts that ...
    Amotz Bar-Noy, Ben Baumer, Dror Rawitz
    claim paper
    Read More »
    TCS
    2016
    43views Theoretical Computer Science» more  TCS 2016»
    A calculus and logic of bunched resources and processes
    8 years 10 days ago
    A calculus and logic of bunched resources and processes
    Download  www.cantab.net
    Abstract. Mathematical modelling and simulation modelling are fundamental tools of engineering, science, and social sciences such as economics, and provide decision-support tools i...
    Gabrielle Anderson, David J. Pym
    claim paper
    Read More »
    TCS
    2016
    46views Theoretical Computer Science» more  TCS 2016»
    Load rebalancing games in dynamic systems with migration costs
    8 years 10 days ago
    Load rebalancing games in dynamic systems with migration costs
    Download  www.faculty.idc.ac.il
    We consider the following dynamic load balancing game: Given an initial assignment of jobs to identical parallel machines, the system is modified; specifically, some machines ar...
    Sofia Belikovetsky, Tami Tamir
    claim paper
    Read More »
    TCS
    2016
    42views Theoretical Computer Science» more  TCS 2016»
    Convex p-partitions of bipartite graphs
    8 years 10 days ago
    Convex p-partitions of bipartite graphs
    Download  www.dim.uchile.cl
    A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p ≥ 1, all partitions of the verte...
    Luciano N. Grippo, Martín Matamala, Mart&ia...
    claim paper
    Read More »
    TCS
    2016
    39views Theoretical Computer Science» more  TCS 2016»
    Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
    8 years 10 days ago
    Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
    Download  cache.oalib.com
    A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A k-clique-colouring of a graph is a colouring of the vertices with at most k co...
    Hélio B. Macêdo Filho, Raphael C. S. ...
    claim paper
    Read More »
    TCS
    2016
    38views Theoretical Computer Science» more  TCS 2016»
    On the state complexity of closures and interiors of regular languages with subwords and superwords
    8 years 10 days ago
    On the state complexity of closures and interiors of regular languages with subwords and superwords
    Download  www.lsv.ens-cachan.fr
    The downward and upward closures of a regular language L are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interior...
    Prateek Karandikar, Matthias Niewerth, Philippe Sc...
    claim paper
    Read More »
    TCS
    2016
    73views Theoretical Computer Science» more  TCS 2016»
    Average-case complexity of the min-sum matrix product problem
    8 years 10 days ago
    Average-case complexity of the min-sum matrix product problem
    Download  tcs.postech.ac.kr
    rder Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi 3D rectangulations and geometric matrix multiplication. Peter Floderus...
    Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Ya...
    claim paper
    Read More »
    TCS
    2016
    50views Theoretical Computer Science» more  TCS 2016»
    Card-based protocols for securely computing the conjunction of multiple variables
    8 years 10 days ago
    Card-based protocols for securely computing the conjunction of multiple variables
    Download  www.tains.tohoku.ac.jp
    Consider a deck of real cards with faces that are either black or red and backs that are all identical. Then, using two cards of different colors, we can commit a secret bit to a...
    Takaaki Mizuki
    claim paper
    Read More »
    « first‹ previous123next ›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.