Sciweavers

    91
    Voted
    JACM
    2007
    113views more  JACM 2007»
    On counting homomorphisms to directed acyclic graphs
    15 years 2 months ago
    On counting homomorphisms to directed acyclic graphs
    Download  www.comp.leeds.ac.uk
    Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson
    claim paper
    Read More »
    93
    Voted
    JACM
    2007
    87views more  JACM 2007»
    A testing scenario for probabilistic processes
    15 years 2 months ago
    A testing scenario for probabilistic processes
    Download  wwwhome.cs.utwente.nl
    Ling Cheung, Mariëlle Stoelinga, Frits W. Vaa...
    claim paper
    Read More »
    112
    Voted
    JACM
    2007
    121views more  JACM 2007»
    (Almost) Tight bounds and existence theorems for single-commodity confluent flows
    15 years 2 months ago
    (Almost) Tight bounds and existence theorems for single-commodity confluent flows
    Download  www.cs.cornell.edu
    A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
    Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
    claim paper
    Read More »
    JACM
    2007
    160views more  JACM 2007»
    Lossless abstraction of imperfect information games
    15 years 2 months ago
    Lossless abstraction of imperfect information games
    Download  www.cs.cmu.edu
    abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
    Andrew Gilpin, Tuomas Sandholm
    claim paper
    Read More »
    92
    Voted
    JACM
    2007
    53views more  JACM 2007»
    Sampling from large matrices: An approach through geometric functional analysis
    15 years 2 months ago
    Sampling from large matrices: An approach through geometric functional analysis
    Download  www.math.missouri.edu
    Mark Rudelson, Roman Vershynin
    claim paper
    Read More »
    JACM
    2007
    93views more  JACM 2007»
    AdWords and generalized online matching
    15 years 2 months ago
    AdWords and generalized online matching
    Download  www.cc.gatech.edu
    Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vij...
    claim paper
    Read More »
    108
    Voted
    JACM
    2007
    79views more  JACM 2007»
    A new look at survey propagation and its generalizations
    15 years 2 months ago
    A new look at survey propagation and its generalizations
    Download  www.eecs.berkeley.edu
    This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
    Elitza N. Maneva, Elchanan Mossel, Martin J. Wainw...
    claim paper
    Read More »
    122
    Voted
    JACM
    2007
    115views more  JACM 2007»
    Optimal pants decompositions and shortest homotopic cycles on an orientable surface
    15 years 2 months ago
    Optimal pants decompositions and shortest homotopic cycles on an orientable surface
    Download  www.di.ens.fr
    We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
    Éric Colin de Verdière, Francis Laza...
    claim paper
    Read More »
    JACM
    2007
    92views more  JACM 2007»
    Periodicity and unbordered words: A proof of the extended duval conjecture
    15 years 2 months ago
    Periodicity and unbordered words: A proof of the extended duval conjecture
    Download  www.fmi.uni-stuttgart.de
    The relationship between the length of a word and the maximum length of its unbordered factors is investigated in this paper. Consider a finite word w of length n. We call a word...
    Tero Harju, Dirk Nowotka
    claim paper
    Read More »
    96
    Voted
    JACM
    2007
    103views more  JACM 2007»
    Approximation via cost sharing: Simpler and better approximation algorithms for network design
    15 years 2 months ago
    Approximation via cost sharing: Simpler and better approximation algorithms for network design
    Download  theory.stanford.edu
    Anupam Gupta, Amit Kumar, Martin Pál, Tim R...
    claim paper
    Read More »
    12next ›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-2026, USA.