Sciweavers

    242 search results - page 47 / 49
    » Auctions with Arbitrary Deals
    Sort
    View
    DC
    2007
    80views Internet Technology» more  DC 2007»
    On private computation in incomplete networks
    13 years 5 months ago
    On private computation in incomplete networks
    Download  www.cs.bgu.ac.il
    Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
    Amos Beimel
    claim paper
    Read More »
    JCB
    2007
    94views more  JCB 2007»
    Locality and Gaps in RNA Comparison
    13 years 5 months ago
    Locality and Gaps in RNA Comparison
    Download  cs.haifa.ac.il
    Locality is an important and well-studied notion in comparative analysis of biological sequences. Similarly, taking into account affine gap penalties when calculating biological ...
    Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M...
    claim paper
    Read More »
    JCP
    2007
    118views more  JCP 2007»
    Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
    13 years 5 months ago
    Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
    Download  www.academypublisher.com
    Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
    Su Chen, Antonio Nucci
    claim paper
    Read More »
    COMBINATORICS
    2002
    92views more  COMBINATORICS 2002»
    Pattern Avoidance in Permutations: Linear and Cyclic Orders
    13 years 5 months ago
    Pattern Avoidance in Permutations: Linear and Cyclic Orders
    Download  www.combinatorics.org
    : We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
    Antoine Vella
    claim paper
    Read More »
    SIAMCOMP
    1998
    114views more  SIAMCOMP 1998»
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
    13 years 5 months ago
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
    Download  www.math.tu-berlin.de
    A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
    Stefan Felsner, Lorenz Wernisch
    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.