Search Results - (( java implication drops algorithm ) OR ( structure representation using algorithm ))

Search alternatives:

Refine Results
  1. 1
    Application Of Exact String Matching Algorithms Towards SMILES Representation Of Chemical Structure.

    Application Of Exact String Matching Algorithms Towards SMILES Representation Of Chemical Structure. by Klaib, Ahmad Fadel, Zainol, Zurinahni, Ahamed Hassain Malim, Nurul Hashimah, Ahmad, Rosma, Hussin, Wahidah

    Published 2007
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    Combinatorial structure associated with low-dimensional filiform leibniz algebras

    Combinatorial structure associated with low-dimensional filiform leibniz algebras by Ahmad Jamri, Ayu Ameliatul Shahilah

    Published 2017
    “…Besides that, an algorithm will be used on association the combinatorial structures with the isomorphism classes of FLbn(K) and SLbn(K). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Image matching using relational graph representation

    Image matching using relational graph representation by Lai, Chui Yen

    Published 2005
    “…This study presents an image matching technique using the structural descriptions of image. Structural descriptions are consist of lines and interline relationship in the line-extracted image. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Enhanced ontology-based text classification algorithm for structurally organized documents

    Enhanced ontology-based text classification algorithm for structurally organized documents by Oleiwi, Suha Sahib

    Published 2015
    “…This research combines the ontology and text representation for classification by developing five algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Compact structure representation in discovering frequent patterns for association rules

    Compact structure representation in discovering frequent patterns for association rules by Mustapha, Norwati, Sulaiman, Md. Nasir, Othman, Mohamed, Selamat, Mohd Hasan

    Published 2002
    “…Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Evaluation of Visual Network Algorithms on Historical Documents

    Evaluation of Visual Network Algorithms on Historical Documents by Khairunnisa, Binti Ibrahim

    Published 2020
    “…The evaluation found that FA2 algorithm when combined with MC algorithm produce the best network representation for SAGA. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    The design and implementation of a two and three-dimensional triangular irregular network based GIS

    The design and implementation of a two and three-dimensional triangular irregular network based GIS by Abdul Rahman, Alias

    Published 2000
    “…The impediments which relate to spatial data especially data representation, data structuring and datamodelling using object-oriented (OO) techniques are the foci of this thesis. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Protein Conformantional Search Using Bees Algorithm

    Protein Conformantional Search Using Bees Algorithm by Bahamish, Hesham Awadh A., Abdullah, Rosni, Salam, Rosalina Abdul

    Published 2008
    “…To this end, an energy function is used to calculate its energy and a conformational search algorithm is used to search the conformational search space to find the lowest free energy corformation.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Compact structure representation in discovering frequent patterns for association rules

    Compact structure representation in discovering frequent patterns for association rules by Mustapha, N., Sulaiman, M.N., Othman, M., Selamat, M.H.

    Published 2002
    “…Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A flexible query transformation framework for structured retrieval / Gan Keng Hoon

    A flexible query transformation framework for structured retrieval / Gan Keng Hoon by Gan, Keng Hoon

    Published 2013
    “…Its main strength is to allow the transformation to be generic to cater for more than single type of structure query. Supporting this intermediate query representation are the query interpretation and query construction algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Single parent mating in genetic algorithm for real robotic system identification

    Single parent mating in genetic algorithm for real robotic system identification by Abd Samad, Md Fahmi, Zainuddin, Farah Ayiesya

    Published 2023
    “…As a popular search method, genetic algorithm (GA) is used for selecting a model structure. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Computing irreducible representations of two-generator groups

    Computing irreducible representations of two-generator groups by Sarmin, Nor Haniza, Robert F., Morse, Ahmad, Satapah, Ahmad, Azhana, Mohd. Ali, Nor Muhainiah

    Published 2009
    “…A totally different approach is used. A new structure is revealed such that base cases exist and other groups within the type are central extension. …”
    Get full text
    Monograph
    Save to List
    Saved in:
  13. 13
    Nonlinear auto-regressive model structure selection using binary particle swarm optimization algorithm / Ahmad Ihsan Mohd Yassin

    Nonlinear auto-regressive model structure selection using binary particle swarm optimization algorithm / Ahmad Ihsan Mohd Yassin by Mohd Yassin, Ahmad Ihsan

    Published 2014
    “…The NARMAX model and its derivatives (Nonlinear Auto-Regressive with Exogenous Inputs (NARX) and Nonlinear Auto-Regressive Moving Average (NARMA)) are powerful, efficient and unified representations of a variety of nonlinear models. The identification process of NARX/NARMA/NARMAX involves structure selection and parameter estimation, which can be simultaneously performed using the widely accepted Orthogonal Least Squares (OLS) algorithm.…”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  14. 14
    Nonlinear auto-regressive model structure selection using binary particle swarm optimization algorithm / Ahmad Ihsan Mohd Yassin

    Nonlinear auto-regressive model structure selection using binary particle swarm optimization algorithm / Ahmad Ihsan Mohd Yassin by Mohd Yassin, Ahmad Ihsan

    Published 2014
    “…The algorithm searches the solution space by selecting various model structures and evaluating its fitness. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Effective query structuring with ranking using named entity categories for XML retrieval

    Effective query structuring with ranking using named entity categories for XML retrieval by Roko, Abubakar

    Published 2016
    “…Query languages are largely used to compose structured queries by users to extract data from XML documents. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Identifying the influential spreaders in multilayer interactions of online social networks

    Identifying the influential spreaders in multilayer interactions of online social networks by Al-Garadi, M.A., Varathan, Kasturi Dewi, Ravana, S.D., Ahmed, E., Chang, V.

    Published 2016
    “…The measurement results are found to be more reliable when the identification algorithms are applied to proposed topological representation compared when these algorithms are applied to single layer representations.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Dissimilarity algorithm on conceptual graphs to mine text outliers

    Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

    Published 2009
    “…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Frequent itemset mining in high dimensional data: a review

    Frequent itemset mining in high dimensional data: a review by Md. Zaki, Fatimah Audah, Zulkurnain, Nurul Fariza

    Published 2019
    “…This paper provides a brief overview of the techniques used in frequent itemset mining. It discusses the search strategies used; i.e. depth first vs. breadth-first, and dataset representation; i.e. horizontal vs. vertical representation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  19. 19
    Enhancement of {0, 1, 3}-NAF Recoding Algorithm using Block Method Technique for Elliptic Curve Cryptosystem

    Enhancement of {0, 1, 3}-NAF Recoding Algorithm using Block Method Technique for Elliptic Curve Cryptosystem by Bafandehkar, Mohsen

    Published 2015
    “…To enhance the reliability of results the average of each run has been calculated and used. The result from the input data yielded the following results: The proposed algorithm has overall 86% speed up in comparison to the base algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Modified word representation vector based scalar weight for contextual text classification

    Modified word representation vector based scalar weight for contextual text classification by Abbas Saliimi, Lokman

    Published 2024
    “…To bridge this gap, a five-phase research methodology is structured to propose and evaluate an algorithm enabling the external modification of LLM-generated word vectors using scalar values as the focus weightage. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: