Sciweavers

    4972 search results - page 40 / 995
    » Ranking on graph data
    Sort
    View
    ALT
    2010
    Springer
    172views Machine Learning» more  ALT 2010»
    PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
    14 years 11 months ago
    PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
    Download  www.sztaki.hu
    Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
    Balázs Csanád Csáji, Rapha&eu...
    claim paper
    Read More »
    CVPR
    2011
    IEEE
    262views Computer Vision» more  CVPR 2011»
    Comparing Data-Dependent and Data-Independent Embeddings for Classification and Ranking of Internet Images
    14 years 7 months ago
    Comparing Data-Dependent and Data-Independent Embeddings for Classification and Ranking of Internet Images
    Download  www.cs.unc.edu
    Yunchao Gong, Svetlana Lazebnik
    claim paper
    Read More »
    KDD
    2005
    ACM
    143views Data Mining» more  KDD 2005»
    SVM selective sampling for ranking with application to data retrieval
    16 years 4 months ago
    SVM selective sampling for ranking with application to data retrieval
    Download  hwanjoyu.org
    Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
    Hwanjo Yu
    claim paper
    Read More »
    AIRS
    2010
    Springer
    225views Information Technology» more  AIRS 2010»
    Learning to Rank with Supplementary Data
    15 years 1 months ago
    Learning to Rank with Supplementary Data
    Download  research.microsoft.com
    This paper is concerned with a new task of ranking, referred to as "supplementary data assisted ranking", or "supplementary ranking" for short. Different from c...
    Wenkui Ding, Tao Qin, Xu-Dong Zhang
    claim paper
    Read More »
    4OR
    2005
    71views more  4OR 2005»
    On rank-perfect subclasses of near-bipartite graphs
    15 years 3 months ago
    On rank-perfect subclasses of near-bipartite graphs
    Download  www.math.uni-magdeburg.de
    Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
    Annegret Wagler
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.