Sciweavers

    343 search results - page 11 / 69
    » Cost Estimation for Ontology Development
    Sort
    View
    SDM
    2009
    SIAM
    105views Data Mining» more  SDM 2009»
    Exploiting Semantic Constraints for Estimating Supersenses with CRFs.
    14 years 4 months ago
    Exploiting Semantic Constraints for Estimating Supersenses with CRFs.
    Download  www.siam.org
    The annotation of words and phrases by ontology concepts is extremely helpful for semantic interpretation. However many ontologies, e.g. WordNet, are too fine-grained and even hu...
    Gerhard Paaß, Frank Reichartz
    claim paper
    Read More »
    SEC
    2007
    134views Security Privacy» more  SEC 2007»
    Ontological Mapping of Common Criteria's Security Assurance Requirements
    13 years 9 months ago
    Ontological Mapping of Common Criteria's Security Assurance Requirements
    Download  publik.tuwien.ac.at
    The Common Criteria (CC) for Information Technology Security Evaluation provides comprehensive guidelines for the evaluation and certification of IT security regarding data securit...
    Andreas Ekelhart, Stefan Fenz, Gernot Goluch, Edga...
    claim paper
    Read More »
    VLDB
    2005
    ACM
    139views Database» more  VLDB 2005»
    Statistical Learning Techniques for Costing XML Queries
    14 years 1 months ago
    Statistical Learning Techniques for Costing XML Queries
    Download  www.vldb2005.org
    Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
    Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...
    claim paper
    Read More »
    PODS
    1998
    ACM
    152views Database» more  PODS 1998»
    A Cost Model for Similarity Queries in Metric Spaces
    13 years 12 months ago
    A Cost Model for Similarity Queries in Metric Spaces
    Download  www-db.deis.unibo.it
    We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
    Paolo Ciaccia, Marco Patella, Pavel Zezula
    claim paper
    Read More »
    DKE
    2006
    123views more  DKE 2006»
    Cost models for distance joins queries using R-trees
    13 years 7 months ago
    Cost models for distance joins queries using R-trees
    Download  isl.cs.unipi.gr
    The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
    Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
    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.