Sciweavers

    IPL
    2007
    105views more  IPL 2007»
    A new algorithm for testing if a regular language is locally threshold testable
    13 years 9 months ago
    A new algorithm for testing if a regular language is locally threshold testable
    Download  www.mimuw.edu.pl
    A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
    Mikolaj Bojanczyk
    claim paper
    Read More »
    AUTOMATICA
    2005
    94views more  AUTOMATICA 2005»
    Algorithms for deterministic balanced subspace identification
    13 years 9 months ago
    Algorithms for deterministic balanced subspace identification
    Download  eprints.ecs.soton.ac.uk
    New algorithms for identification of a balanced state space representation are proposed. They are based on a procedure for the estimation of impulse response and sequential zero i...
    Ivan Markovsky, Jan C. Willems, Paolo Rapisarda, B...
    claim paper
    Read More »
    IPL
    2007
    80views more  IPL 2007»
    Execution time analysis of a top-down R-tree construction algorithm
    13 years 9 months ago
    Execution time analysis of a top-down R-tree construction algorithm
    Download  www.cs.umd.edu
    A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y.J. García, M.A. López, S.T. Leuten...
    Houman Alborzi, Hanan Samet
    claim paper
    Read More »
    TCS
    2008
    144views Theoretical Computer Science» more  TCS 2008»
    Algorithms for computing variants of the longest common subsequence problem
    13 years 9 months ago
    Algorithms for computing variants of the longest common subsequence problem
    Download  www.dcs.kcl.ac.uk
    The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
    Costas S. Iliopoulos, M. Sohel Rahman
    claim paper
    Read More »
    ASE
    2005
    137views more  ASE 2005»
    Rewriting-Based Techniques for Runtime Verification
    13 years 9 months ago
    Rewriting-Based Techniques for Runtime Verification
    Download  www.havelund.com
    Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
    Grigore Rosu, Klaus Havelund
    claim paper
    Read More »
    INTEGRATION
    2007
    90views more  INTEGRATION 2007»
    Partitioning-based decoupling capacitor budgeting via sequence of linear programming
    13 years 9 months ago
    Partitioning-based decoupling capacitor budgeting via sequence of linear programming
    Download  web.eng.fiu.edu
    In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. The new method is based on the sequence of linear p...
    Jeffrey Fan, Sheldon X.-D. Tan, Yici Cai, Xianlong...
    claim paper
    Read More »
    AROBOTS
    2005
    114views more  AROBOTS 2005»
    Visually Guided Cooperative Robot Actions Based on Information Quality
    13 years 9 months ago
    Visually Guided Cooperative Robot Actions Based on Information Quality
    Download  robots.mit.edu
    In field environments it is not usually possible to provide robots in advance with valid geometric models of its environment and task element locations. The robot or robot teams ne...
    Vivek A. Sujan, Steven Dubowsky
    claim paper
    Read More »
    INFORMATICALT
    2007
    75views more  INFORMATICALT 2007»
    An Effective Method for Initialization of Lloyd-Max's Algorithm of Optimal Scalar Quantization for Laplacian Source
    13 years 9 months ago
    An Effective Method for Initialization of Lloyd-Max's Algorithm of Optimal Scalar Quantization for Laplacian Source
    Download  www.mii.lt
    Abstract. In this paper an exact and complete analysis of the Lloyd–Max’s algorithm and its initialization is carried out. An effective method for initialization of Lloyd–Max...
    Zoran Peric, Jelena Nikolic
    claim paper
    Read More »
    TCAD
    2008
    100views more  TCAD 2008»
    Robust Clock Tree Routing in the Presence of Process Variations
    13 years 9 months ago
    Robust Clock Tree Routing in the Presence of Process Variations
    Download  dropzone.tamu.edu
    Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
    Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
    claim paper
    Read More »
    APPML
    2005
    101views more  APPML 2005»
    A numerical method for mass spectral data analysis
    13 years 9 months ago
    A numerical method for mass spectral data analysis
    Download  www.ctcms.nist.gov
    The new generation of mass spectrometers produces an astonishing amount of high-quality data in a brief period of time, leading to inevitable data analysis bottlenecks. Automated ...
    Anthony J. Kearsley, William E. Wallace, Javier Be...
    claim paper
    Read More »
    « first‹ previous…808182838485868788…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.