Sciweavers

    TMI
    2002
    185views more  TMI 2002»
    A modified fuzzy c-means algorithm for bias field estimation and segmentation of MRI data
    13 years 9 months ago
    A modified fuzzy c-means algorithm for bias field estimation and segmentation of MRI data
    Download  www.cvip.uofl.edu
    In this paper, we present a novel algorithm for fuzzy segmentation of magnetic resonance imaging (MRI) data and estimation of intensity inhomogeneities using fuzzy logic. MRI inten...
    Mohamed N. Ahmed, Sameh M. Yamany, Nevin Mohamed, ...
    claim paper
    Read More »
    TKDE
    2002
    109views more  TKDE 2002»
    Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
    13 years 9 months ago
    Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
    Download  www.icmc.usp.br
    Caetano Traina Jr., Agma J. M. Traina, Christos Fa...
    claim paper
    Read More »
    TIT
    2002
    146views more  TIT 2002»
    Bounds on the performance of belief propagation decoding
    13 years 9 months ago
    Bounds on the performance of belief propagation decoding
    Download  www.eng.tau.ac.il
    We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
    David Burshtein, Gadi Miller
    claim paper
    Read More »
    TIT
    2002
    67views more  TIT 2002»
    Closest point search in lattices
    13 years 9 months ago
    Closest point search in lattices
    Download  www-ee.ccny.cuny.edu
    In this semitutorial paper, a comprehensive survey of closest point search methods for lattices without a regular structure is presented. The existing search strategies are describ...
    Erik Agrell, Thomas Eriksson, Alexander Vardy, Ken...
    claim paper
    Read More »
    TIP
    2002
    93views more  TIP 2002»
    Joint source-channel coding for motion-compensated DCT-based SNR scalable video
    13 years 9 months ago
    Joint source-channel coding for motion-compensated DCT-based SNR scalable video
    Download  www.cs.uoi.gr
    In this paper, we develop an approach toward joint source-channel coding for motion-compensated DCT-based scalable video coding and transmission. A framework for the optimal select...
    Lisimachos P. Kondi, Faisal Ishtiaq, Aggelos K. Ka...
    claim paper
    Read More »
    TEC
    2002
    112views more  TEC 2002»
    Data mining with an ant colony optimization algorithm
    13 years 9 months ago
    Data mining with an ant colony optimization algorithm
    Download  www.cs.kent.ac.uk
    Rafael S. Parpinelli, Heitor S. Lopes, Alex Alves ...
    claim paper
    Read More »
    TEC
    2002
    152views more  TEC 2002»
    Ant colony optimization for resource-constrained project scheduling
    13 years 9 months ago
    Ant colony optimization for resource-constrained project scheduling
    Download  pacosy.informatik.uni-leipzig.de
    An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
    Daniel Merkle, Martin Middendorf, Hartmut Schmeck
    claim paper
    Read More »
    TEC
    2002
    183views more  TEC 2002»
    The particle swarm - explosion, stability, and convergence in a multidimensional complex space
    13 years 9 months ago
    The particle swarm - explosion, stability, and convergence in a multidimensional complex space
    Download  www.cil.pku.edu.cn
    Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
    Maurice Clerc, James Kennedy
    claim paper
    Read More »
    TCS
    2002
    96views Theoretical Computer Science» more  TCS 2002»
    Some permutation routing algorithms for low-dimensional hypercubes
    13 years 9 months ago
    Some permutation routing algorithms for low-dimensional hypercubes
    Download  www.cs.uic.edu
    Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
    Frank K. Hwang, Y. C. Yao, Bhaskar DasGupta
    claim paper
    Read More »
    TCS
    2002
    98views Theoretical Computer Science» more  TCS 2002»
    MAX3SAT is exponentially hard to approximate if NP has positive dimension
    13 years 9 months ago
    MAX3SAT is exponentially hard to approximate if NP has positive dimension
    Download  www.cs.uwyo.edu
    Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
    John M. Hitchcock
    claim paper
    Read More »
    « first‹ previous…535455565758596061…next ›last »
    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.