Sciweavers

    84 search results - page 8 / 17
    » Computing Clusters of Correlation Connected Objects
    Sort
    View
    DAGSTUHL
    2010
    202views Software Engineering» more  DAGSTUHL 2010»
    Generalized Hyper-cylinders: a Mechanism for Modeling and Visualizing N-D Objects
    13 years 9 months ago
    Generalized Hyper-cylinders: a Mechanism for Modeling and Visualizing N-D Objects
    Download  drops.dagstuhl.de
    The display of surfaces and solids has usually been restricted to the domain of scientific visualization; however, little work has been done on the visualization of surfaces and s...
    Matthew O. Ward, Zhenyu Guo
    claim paper
    Read More »
    BMCBI
    2006
    161views more  BMCBI 2006»
    A novel approach to phylogenetic tree construction using stochastic optimization and clustering
    13 years 8 months ago
    A novel approach to phylogenetic tree construction using stochastic optimization and clustering
    Download  www.biomedcentral.com
    Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
    Ling Qin, Yixin Chen, Yi Pan, Ling Chen
    claim paper
    Read More »
    WIMOB
    2008
    IEEE
    114views Communications» more  WIMOB 2008»
    Rate Allocation with Lifetime Maximization and Fairness for Data Aggregation in Sensor Networks
    14 years 2 months ago
    Rate Allocation with Lifetime Maximization and Fairness for Data Aggregation in Sensor Networks
    Download  www.real-time.ece.vt.edu
    —We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
    Shouwen Lai, Binoy Ravindran, Hyeonjoong Cho
    claim paper
    Read More »
    STOC
    2009
    ACM
    172views Algorithms» more  STOC 2009»
    Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
    14 years 8 months ago
    Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
    Download  www.cs.brown.edu
    We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
    Marek Karpinski, Warren Schudy
    claim paper
    Read More »
    NIPS
    2001
    208views Information Technology» more  NIPS 2001»
    Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
    13 years 9 months ago
    Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
    Download  www.cs.utsa.edu
    Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
    Mikhail Belkin, Partha Niyogi
    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.