Sciweavers

    4066 search results - page 46 / 814
    » Almost Complete Sets
    Sort
    View
    ALENEX
    2003
    144views Algorithms» more  ALENEX 2003»
    Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
    13 years 11 months ago
    Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
    Download  www.charlierobbins.com
    Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
    Ranjan Sinha, Justin Zobel
    claim paper
    Read More »
    FLAIRS
    2006
    119views Artificial Intelligence» more  FLAIRS 2006»
    Using Web Searches on Important Words to Create Background Sets for LSI Classification
    13 years 11 months ago
    Using Web Searches on Important Words to Create Background Sets for LSI Classification
    Download  www.cs.csi.cuny.edu
    The world wide web has a wealth of information that is related to almost any text classification task. This paper presents a method for mining the web to improve text classificati...
    Sarah Zelikovitz, Marina Kogan
    claim paper
    Read More »
    ASPDAC
    2009
    ACM
    133views Hardware» more  ASPDAC 2009»
    A combined analytical and simulation-based model for performance evaluation of a reconfigurable instruction set processor
    13 years 11 months ago
    A combined analytical and simulation-based model for performance evaluation of a reconfigurable instruction set processor
    Download  www.c.csce.kyushu-u.ac.jp
    Performance evaluation is a serious challenge in designing or optimizing reconfigurable instruction set processors. The conventional approaches based on synthesis and simulations a...
    Farhad Mehdipour, Hamid Noori, Bahman Javadi, Hiro...
    claim paper
    Read More »
    JMLR
    2011
    133views more  JMLR 2011»
    Operator Norm Convergence of Spectral Clustering on Level Sets
    13 years 5 months ago
    Operator Norm Convergence of Spectral Clustering on Level Sets
    Download  jmlr.csail.mit.edu
    Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
    Bruno Pelletier, Pierre Pudlo
    claim paper
    Read More »
    EUROCRYPT
    2012
    Springer
    253views Cryptology» more  EUROCRYPT 2012»
    Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
    12 years 11 days ago
    Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
    Download  www.cits.rub.de
    Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
    Anja Becker, Antoine Joux, Alexander May, Alexande...
    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.