Sciweavers

    1798 search results - page 97 / 360
    » A Tree for All Seasons
    Sort
    View
    CATS
    1998
    126views Applied Computing» more  CATS 1998»
    Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
    13 years 10 months ago
    Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
    Download  dimacs.rutgers.edu
    Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
    Weifa Liang, George Havas
    claim paper
    Read More »
    EOR
    2008
    70views more  EOR 2008»
    Robust portfolio selection based on a multi-stage scenario tree
    13 years 9 months ago
    Robust portfolio selection based on a multi-stage scenario tree
    Download  www.se.cuhk.edu.hk
    The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
    Ruijun Shen, Shuzhong Zhang
    claim paper
    Read More »
    SIGMOD
    2008
    ACM
    127views Database» more  SIGMOD 2008»
    Minimization of tree pattern queries with constraints
    13 years 8 months ago
    Minimization of tree pattern queries with constraints
    Download  www.comp.nus.edu.sg
    Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
    Ding Chen, Chee Yong Chan
    claim paper
    Read More »
    CANDC
    2005
    ACM
    115views Emerging Technology» more  CANDC 2005»
    Integer linear programming as a tool for constructing trees from quartet data
    13 years 8 months ago
    Integer linear programming as a tool for constructing trees from quartet data
    Download  gobics.de
    The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
    Jan Weyer-Menkhoff, Claudine Devauchelle, Alexande...
    claim paper
    Read More »
    CGF
    1998
    101views more  CGF 1998»
    Rapid and Accurate Contact Determination between Spline Models using ShellTrees
    13 years 8 months ago
    Rapid and Accurate Contact Determination between Spline Models using ShellTrees
    Download  ftp.cs.unc.edu
    In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
    Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
    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.