Sciweavers

    493 search results - page 97 / 99
    » types 1998
    Sort
    View
    MST
    1998
    91views more  MST 1998»
    An Experimental Analysis of Parallel
    14 years 9 months ago
    An Experimental Analysis of Parallel
    Download  www.cs.cmu.edu
    We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
    Guy E. Blelloch, Charles E. Leiserson
    claim paper
    Read More »
    MTA
    1998
    119views more  MTA 1998»
    A New Indexing Scheme for Content-Based Image Retrieval
    14 years 9 months ago
    A New Indexing Scheme for Content-Based Image Retrieval
    Download  islab.kaist.ac.kr
    We propose a new efficient indexing scheme, called the HG-tree, to support content-based retrieval in image databases. Image content is represented by a point in a multidimensional...
    Guang-Ho Cha, Chin-Wan Chung
    claim paper
    Read More »
    93
    Voted
    NN
    1998
    Springer
    177views Neural Networks» more  NN 1998»
    Soft vector quantization and the EM algorithm
    14 years 9 months ago
    Soft vector quantization and the EM algorithm
    Download  www.cmpe.boun.edu.tr
    The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
    Ethem Alpaydin
    claim paper
    Read More »
    69
    Voted
    TIP
    1998
    99views more  TIP 1998»
    Nonlinear image estimation using piecewise and local image models
    14 years 9 months ago
    Nonlinear image estimation using piecewise and local image models
    Download  viva.ee.virginia.edu
    —We introduce a new approach to image estimation based on a flexible constraint framework that encapsulates meaningful structural image assumptions. Piecewise image models (PIMâ...
    Scott T. Acton, Alan C. Bovik
    claim paper
    Read More »
    TIT
    1998
    90views more  TIT 1998»
    On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
    14 years 9 months ago
    On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
    Download  www.cst.uwaterloo.ca
    —Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
    Amir H. Banihashemi, Amir K. Khandani
    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-2025, USA.