Sciweavers

    104 search results - page 20 / 21
    » On an Online Spanning Tree Problem in Randomly Weighted Grap...
    Sort
    View
    TSP
    2008
    101views more  TSP 2008»
    Optimal Node Density for Detection in Energy-Constrained Random Networks
    13 years 7 months ago
    Optimal Node Density for Detection in Energy-Constrained Random Networks
    Download  acsp.ece.cornell.edu
    The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
    Animashree Anandkumar, Lang Tong, Ananthram Swami
    claim paper
    Read More »
    SDM
    2009
    SIAM
    160views Data Mining» more  SDM 2009»
    Discovering Substantial Distinctions among Incremental Bi-Clusters.
    14 years 4 months ago
    Discovering Substantial Distinctions among Incremental Bi-Clusters.
    Download  www.siam.org
    A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
    Faris Alqadah, Raj Bhatnagar
    claim paper
    Read More »
    COCOA
    2009
    Springer
    169views Discrete Geometry» more  COCOA 2009»
    An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
    13 years 10 months ago
    An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
    Download  theory.utdallas.edu
    stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
    Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
    claim paper
    Read More »
    BMCBI
    2010
    178views more  BMCBI 2010»
    Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
    13 years 7 months ago
    Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
    Download  www.biomedcentral.com
    Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
    David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
    claim paper
    Read More »
    COCOA
    2009
    Springer
    118views Discrete Geometry» more  COCOA 2009»
    On Open Rectangle-of-Influence Drawings of Planar Graphs
    14 years 2 days ago
    On Open Rectangle-of-Influence Drawings of Planar Graphs
    Download  theory.utdallas.edu
    : Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
    Huaming Zhang, Milind Vaidya
    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.