Sciweavers

    2218 search results - page 2 / 444
    » Testing Expressibility Is Hard
    Sort
    View
    KBSE
    2007
    IEEE
    99views Software Engineering» more  KBSE 2007»
    Scalable automatic test data generation from modeling diagrams
    14 years 1 months ago
    Scalable automatic test data generation from modeling diagrams
    Download  www.cs.umass.edu
    We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, prim...
    Yannis Smaragdakis, Christoph Csallner, Ranjith Su...
    claim paper
    Read More »
    BMCBI
    2007
    174views more  BMCBI 2007»
    Inferring activity changes of transcription factors by binding association with sorted expression profiles
    13 years 7 months ago
    Inferring activity changes of transcription factors by binding association with sorted expression profiles
    Download  www.biomedcentral.com
    Background: The identification of transcription factors (TFs) associated with a biological process is fundamental to understanding its regulatory mechanisms. From microarray data,...
    Chao Cheng, Xiting Yan, Fengzhu Sun, Lei M. Li
    claim paper
    Read More »
    STOC
    2003
    ACM
    102views Algorithms» more  STOC 2003»
    Some 3CNF properties are hard to test
    14 years 7 months ago
    Some 3CNF properties are hard to test
    Download  ttic.uchicago.edu
    For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
    Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
    claim paper
    Read More »
    PVLDB
    2008
    108views more  PVLDB 2008»
    Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
    13 years 6 months ago
    Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
    Download  www.cse.unsw.edu.au
    Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
    Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
    claim paper
    Read More »
    GD
    2008
    Springer
    90views Computer Graphics» more  GD 2008»
    Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
    13 years 8 months ago
    Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
    Download  www.imfm.si
    Vladimir P. Korzhik, Bojan Mohar
    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.