• Corpus ID: 235358600

AMV : Algorithm Metadata Vocabulary

  title={AMV : Algorithm Metadata Vocabulary},
  author={Biswanath Dutta and Jyotima Patel},
Metadata vocabularies are used in various domains of study. It provides an in-depth description of the resources. In this work, we develop Algorithm Metadata Vocabulary (AMV), a vocabulary for capturing and storing the metadata about the algorithms (a procedure or a set of rules that is followed step-by-step to solve a problem, especially by a computer). The snag faced by the researchers in the current time is the failure of getting relevant results when searching for algorithms in any search… 

Figures from this paper

An Approach for Automatic Construction of an Algorithmic Knowledge Graph from Textual Resources

An approach for automatically developing a knowledge graph (KG) for algorithmic problems from unstructured data because it captures information more clearly and extensively, an algorithm KG will give additional context and explainability to the algorithm metadata.

An Approach for Automatic Construction of an_new.docx



    New Generation Metadata Vocabulary for Ontology Description and Publication

    A new version of Metadata vocabulary for Ontology Description and publication, referred as MOD 1.2, which succeeds previous work published in 2015 and proposes in total 88 properties to serve both as a vocabulary to be used by ontology developers to annotate and describe their ontologies.

    MOD: Metadata for Ontology Description and Publication

    This work presents an ontology metadata vocabulary called Metadata for Ontology Description and publication (MOD), and proposes a set of generic guiding principles and a well-established methodology which take into account real concerns of the ontology users and practitioners.

    CODO: An Ontology for Collection and Analysis of Covid-19 Data

    The COviD-19 Ontology for cases and patient information (CODO) provides a model for the collection and analysis of data about the COVID-19 pandemic. The ontology provides a standards-based

    Algorithms and Complexity

    • H. Wilf
    • Computer Science
      Lecture Notes in Computer Science
    • 1997
    A computation that is guaranteed to take at most cn3 time for input of size n will be thought of as an ‘easy’ computation, and one that needs at most n10 time is also easy.

    Who is interested in algorithms and why?: lessons from the Stony Brook algorithms repository

    This work analyzes WWW hits recorded on the Stony Brook Algorithms Repository to determine the relative level of interest among 75 algorithmic problems and the extent to which publicly available algorithm implementations satisfy this demand.

    The Stony Brook Algorithm Repository

    Process for the irregular dyeing of textile material, preferably in a continuous operation, by applying a mixture of dyestuffs and salts containing crystal water in powder form irregularly onto the

    Travelling Salesman Problem | Branch & Bound

      Introducing the knowledge graph:things, not strings

        Data Catalog Vocabulary (DCAT) -Version 2

        • DCMI: Dublin Core™ Metadata Element Set, Version 1.1: Reference Description