Sciweavers

    598 search results - page 88 / 120
    » The Puzzle Layout Problem
    Sort
    View
    SC
    1995
    ACM
    167views Applied Computing» more  SC 1995»
    A Novel Approach Towards Automatic Data Distribution
    13 years 11 months ago
    A Novel Approach Towards Automatic Data Distribution
    Download  www.chg.ru
    : Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
    Jordi Garcia, Eduard Ayguadé, Jesús ...
    claim paper
    Read More »
    ASPDAC
    2008
    ACM
    104views Hardware» more  ASPDAC 2008»
    Low power clock buffer planning methodology in F-D placement for large scale circuit design
    13 years 9 months ago
    Low power clock buffer planning methodology in F-D placement for large scale circuit design
    Download  dropzone.tamu.edu
    Traditionally, clock network layout is performed after cell placement. Such methodology is facing a serious problem in nanometer IC designs where people tend to use huge clock buff...
    Yanfeng Wang, Qiang Zhou, Yici Cai, Jiang Hu, Xian...
    claim paper
    Read More »
    TRECVID
    2008
    123views Internet Technology» more  TRECVID 2008»
    Peking University at TRECVID 2008: High Level Feature Extraction
    13 years 9 months ago
    Peking University at TRECVID 2008: High Level Feature Extraction
    Download  www-nlpir.nist.gov
    We participated in one task of TRECVID 2008, that is, the high-level feature extraction (HLFE). This paper presents our approaches and results on the HLFE task. We mainly focus on...
    Yuxin Peng, Zhiguo Yang, Jian Yi, Lei Cao, Hao Li,...
    claim paper
    Read More »
    JEA
    2006
    83views more  JEA 2006»
    Cache-Friendly implementations of transitive closure
    13 years 7 months ago
    Cache-Friendly implementations of transitive closure
    Download  www.cc.gatech.edu
    In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
    Michael Penner, Viktor K. Prasanna
    claim paper
    Read More »
    TC
    2008
    109views Information Technology» more  TC 2008»
    Optimal and Practical Algorithms for Sorting on the PDM
    13 years 7 months ago
    Optimal and Practical Algorithms for Sorting on the PDM
    Download  www.cse.iitd.ernet.in
    Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
    Sanguthevar Rajasekaran, Sandeep Sen
    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.