Sciweavers

    567 search results - page 43 / 114
    » Reconstructing Numbers from Pairwise Function Values
    Sort
    View
    BMCBI
    2007
    107views more  BMCBI 2007»
    A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
    13 years 8 months ago
    A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
    Download  www.biomedcentral.com
    Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
    Francois Besnier, Örjan Carlborg
    claim paper
    Read More »
    CVPR
    2012
    IEEE
    197views Computer Vision» more  CVPR 2012»
    Robust late fusion with rank minimization
    11 years 11 months ago
    Robust late fusion with rank minimization
    Download  www.ee.columbia.edu
    In this paper, we propose a rank minimization method to fuse the predicted confidence scores of multiple models, each of which is obtained based on a certain kind of feature. Spe...
    Guangnan Ye, Dong Liu, I-Hong Jhuo, Shih-Fu Chang
    claim paper
    Read More »
    BMCBI
    2007
    90views more  BMCBI 2007»
    Gene network interconnectedness and the generalized topological overlap measure
    13 years 8 months ago
    Gene network interconnectedness and the generalized topological overlap measure
    Download  www.biomedcentral.com
    Background: Network methods are increasingly used to represent the interactions of genes and/ or proteins. Genes or proteins that are directly linked may have a similar biological...
    Andy M. Yip, Steve Horvath
    claim paper
    Read More »
    OL
    2007
    156views more  OL 2007»
    A trust region SQP algorithm for mixed-integer nonlinear programming
    13 years 8 months ago
    A trust region SQP algorithm for mixed-integer nonlinear programming
    Download  www.math.uni-bayreuth.de
    We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
    Oliver Exler, Klaus Schittkowski
    claim paper
    Read More »
    SIGECOM
    2008
    ACM
    155views ECommerce» more  SIGECOM 2008»
    Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
    13 years 8 months ago
    Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
    Download  www.cs.huji.ac.il
    We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
    Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
    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.