Sciweavers

    5595 search results - page 437 / 1119
    » Approximation Algorithms for Clustering Problems
    Sort
    View
    238
    Voted
    TSMC
    2010
    202views Artificial Intelligence» more  TSMC 2010»
    Distance Approximating Dimension Reduction of Riemannian Manifolds
    15 years 1 months ago
    Distance Approximating Dimension Reduction of Riemannian Manifolds
    Download  www.tcs.fudan.edu.cn
    We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
    Changyou Chen, Junping Zhang, Rudolf Fleischer
    claim paper
    Read More »
    236
    Voted
    SDM
    2004
    SIAM
    187views Data Mining» more  SDM 2004»
    Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data
    15 years 8 months ago
    Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data
    Download  www.cs.utexas.edu
    Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...
    Hyuk Cho, Inderjit S. Dhillon, Yuqiang Guan, Suvri...
    claim paper
    Read More »
    207
    Voted
    SAT
    2010
    Springer
    172views Hardware» more  SAT 2010»
    On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
    15 years 5 months ago
    On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
    Download  www.cs.toronto.edu
    Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
    Denis Pankratov, Allan Borodin
    claim paper
    Read More »
    GECCO
    2005
    Springer
    107views Optimization» more  GECCO 2005»
    Minimum spanning trees made easier via multi-objective optimization
    16 years 12 days ago
    Minimum spanning trees made easier via multi-objective optimization
    Download  www.cs.bham.ac.uk
    Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
    Frank Neumann, Ingo Wegener
    claim paper
    Read More »
    219
    Voted
    BIBE
    2008
    IEEE
    142views Bioinformatics» more  BIBE 2008»
    Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
    16 years 1 months ago
    Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
    Download  people.cs.vt.edu
    — The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
    Ashwin M. Aji, Wu-chun Feng
    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.