tree-based search approach
Novel Approach for Arabic Spell Checker: Based on Radix Search Tree
... The main aim of this study is to develop a spell-checker system for Arabic language. This is done by investigating the viability of applying the radix search tree approach. Through this scientific ...
5
Generating with a Grammar Based on Tree Descriptions: a Constraint Based Approach
... a tree reconstruction method which incrementally improves the syntactic tree until it is accepted by the ...the search space involved in the generation ...
8
Complexity Reduction of Explicit Model Predictive Control via Combining Separator Function and Binary Search Trees
... approaches based on complexity reduction is addressed. The binary search tree and complexity reduction via separation are efficient methods which can be confined to small problems, but merging them ...
5
Planning chemical syntheses with deep neural networks and symbolic AI
... related search algorithms (see Table 2) at a runtime limit of 3×300 s (three ...Carlo search (MC) randomly selects transforms using the expansion policy network, without building a ...the search via ...
19
Node Based Parallel Game Tree Search Algorithm Using Accelerated GPU
... using tree based approach consist of drawbacks like searching is done using DFS manner, it requires more time for ...a tree-based approach many choices of games are computed ...
8
Parallelization of Node Based Game Tree Search Algorithm on GPU
... hybrid approach takes an advantage of computation on CPU in DFS manner and evaluation of nodes by GPU in BFS ...This approach can be applied for HEX, CHESS, Connect4/Connect6 ...implementation. ...
9
Vol 4, No 9 (2016)
... an approach called Commutative RSA has been ...computed based on the following equation Let represent the encrypted data ...B- Tree: A B-tree is a data structure as shown in Figure 2. The ...
5
IP Address Lookup in an IP Router Based On a Reorganized Binary Prefixes Value Tree (RBPVT)
... function search complexity. Our approach is used to improve the routing information search time in the prefixes values binary tree by periodically reorganizing the tree according to the ...
7
A Survey on Cabinet Tree Based Approach to Approach Visualizing and Exploring Big Data
... The primary objective of this research is the effective visualization of large bodies of hierarchically structured information. Effective visualizations of large bodies of hierarchically structured information can help ...
6
A Tree based Approach for Generating Association Rules
... one based on the use of intelligent agents to navigate through an information-rich ...and search for related information among a wide variety of public-do-main and proprietary ...
5
Confidentiality Preserving Efficient and Dynamic Multi-Keyword Ranked Search over Encoded Multi Cloud Data
... dynamic search scheme is proposed, which supports not only the accurate multi-keyword ranked search but also the dynamic deletion and insertion of ...binary tree as the index, and propose a “Greedy ...
6
An Efficient and Privacy Preserving in Multi- Keyword Ranked Search over Encrypted Cloud Data
... ranked search scheme over encrypted cloud data, which supports dynamic update operations like deletion and insertion of ...special tree-based index structure and introduces a Greedy Depth-first ...
5
Experimental evaluation of Refined Google Search using CLIR
... improve search result of Google using Cross Lingual Cross Language Information ...the search results of the Google using gps based or location ...Goggle search result in their own native ...
5
A Linear Delay Algorithm for Enumerating All Connected Induced Subgraphs
... Reverse Search is a powerful paradigm for ...Reverse Search is to arrange all subsets to be enumerated in a tree, where each node in the tree appears only ...reverse search algorithm is ...
45
Review on Phase Based Semantic Search Using Suffix Tree Clustering
... postfix tree model of substance ...postfix tree closeness that solidifies with TF-IDF weighting ...gathering based procedures, our proposed system achieves an improvement of about 15% on the typical ...
6
Empirical Analysis of Secured Data Maintenance over Cloud Schema with Advanced Searching Environment
... secure tree-based search scheme over the encrypted cloud data, which supports multi- keyword ranked search and dynamic operation on the document ...ranked search. In order to obtain ...
6
Fast vector Quantization of Color Image Coding with Single Codebook based on Orthogonal Polynomials
... Binary Tree(TBT) codebook generation algorithm exhibits higher computational efficiency and lower memory space, by focusing on the tasks of choosing the effective feature as split key and a good decision principle ...
7
Reformation of Query Based Approach in Search Engine
... Reformulation of queries in search is aimed at addressing the problem of maturity mismatch. For example, if the query is " apjabdulkalam " and the document only contains " Famous books by Dr.APJ Abdul ...
8
Tree Based Orthogonal Least Squares Regression with Repeated Weighted Boosting Search
... of tree structure search, this paper is to construct an even sparser regression model in the framework of OLSR with ...subtree search to decrease experimental time complexity, by specifying the total ...
9
DESPITE the many advances in machine learning and
... a search, where the root of the search tree is the current position, and the leaf nodes (at some predefined depth of the tree) are evaluated by some static evaluation ...the search ...
11