Sciweavers

    69 search results - page 10 / 14
    » ejc 2008
    Sort
    View
    EJC
    2008
    124views Information Technology» more  EJC 2008»
    An Efficient Method for Quick Construction of Web Services
    14 years 9 days ago
    An Efficient Method for Quick Construction of Web Services
    Download  tokuda-www.cs.titech.ac.jp
    With the development of the Internet, Web services, such as Google Maps API and YouTube Data API, become more important and convenient for the Web knowledge distribution and integr...
    Hao Han, Yohei Kotake, Takehiro Tokuda
    claim paper
    Read More »
    EJC
    2008
    76views Information Technology» more  EJC 2008»
    Embeddability of arrangements of pseudocircles into the sphere
    13 years 11 months ago
    Embeddability of arrangements of pseudocircles into the sphere
    Download  personal.unileoben.ac.at
    An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure ...
    Ronald Ortner
    claim paper
    Read More »
    EJC
    2008
    107views Information Technology» more  EJC 2008»
    Pattern classes of permutations via bijections between linearly ordered sets
    13 years 11 months ago
    Pattern classes of permutations via bijections between linearly ordered sets
    Download  www-circa.mcs.st-and.ac.uk
    Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
    Sophie Huczynska, Nikola Ruskuc
    claim paper
    Read More »
    EJC
    2008
    152views Information Technology» more  EJC 2008»
    Expansion properties of a random regular graph after random vertex deletions
    13 years 11 months ago
    Expansion properties of a random regular graph after random vertex deletions
    Download  web.maths.unsw.edu.au
    We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
    Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
    claim paper
    Read More »
    EJC
    2008
    79views Information Technology» more  EJC 2008»
    On Postnikov's hook length formula for binary trees
    13 years 11 months ago
    On Postnikov's hook length formula for binary trees
    Download  www.math.ualberta.ca
    We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
    William Y. C. Chen, Laura L. M. Yang
    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.