• No results found

efficient algorithm

An Efficient Algorithm for Mining Frequent Closed Itemsets

An Efficient Algorithm for Mining Frequent Closed Itemsets

... the algorithm A-close and CLOSET, we propose an efficient algorithm for mining frequent closed itemsets, which is based on Galois connection and granular ...the algorithm save reading the ...

12

An Efficient algorithm for Fuzzy based Metagraph ADT

An Efficient algorithm for Fuzzy based Metagraph ADT

... Abstract- This paper proposes an efficient algorithm for Fuzzy based Metagraph ADT (Abstract Data Type). It is a hierarchical data structure where every node has one or more data. A mathematical model which ...

7

DHCC: An Efficient Algorithm for Supervised Discretization

DHCC: An Efficient Algorithm for Supervised Discretization

... The existing discretization algorithms are mainly based on statistical independence, information entropy, class attribute interdependence, Bayesian classifier [3,9,10]. During using these methods in the process of each ...

7

An Efficient Algorithm for Sign Language          Recognition

An Efficient Algorithm for Sign Language Recognition

... American sign language(ASL) used in America is different from the british sign language (BSL) of Britain. In the same way Indian sign language(ISL), Japanese Sign language(JSL) and French sign language (FSL) are ...

7

AN EFFICIENT ALGORITHM FOR CRASHING

AN EFFICIENT ALGORITHM FOR CRASHING

... new algorithm which works on UCM logic but requires less ...LCS. Algorithm can be viewed as modified Unit Time Method; would always yield the optimum in very less iterations (10 to 30% ...

8

Efficient algorithm for designing weighted voting games

Efficient algorithm for designing weighted voting games

... main algorithm to design weighted voting games and its ...our algorithm which is to use the Penrose Law to design ‘egalitarian’ weighted voting ...our algorithm can be used to find the ...

23

Energy Efficient Algorithm for WSN - A Review

Energy Efficient Algorithm for WSN - A Review

... Main motto behind this idea is energy-saving which is based on clustering technique. It follows the following two considerations: firstly- maximizes the lifetime of the network. Secondly- maximizes the amount of data ...

5

An Efficient Algorithm for Workspace Generation of Delta Robot

An Efficient Algorithm for Workspace Generation of Delta Robot

... It is expensive in computation and its results are limited to the nodes of the grid. Thus, there is no guarantee that the space between two valid nodes is acceptable, too. Using geometrical method, the workspace can be ...

6

DPML-Risk: An Efficient Algorithm for Image Registration

DPML-Risk: An Efficient Algorithm for Image Registration

... Alahi et al. [12] introduced the Fast Retina Keypoint (FREAK) descriptor. This descriptor is similar to the BRISK but with a different sampling pattern which is inspired by the human visual system, the retina. In this ...

8

IREMD: An Efficient Algorithm for Iris Recognition

IREMD: An Efficient Algorithm for Iris Recognition

... In most of iris recognition works, firstly iris region is segmented and it is mapped to a rectangular region in polar co-ordinate and then features are extracted from this region. The features obtained are compared with ...

8

An Efficient Algorithm for Conversion of Spatiotemporal Big Data

An Efficient Algorithm for Conversion of Spatiotemporal Big Data

... The below figure shows data retrieval algorithm. It basically allows the user to select the parameters like humidity, rainfall, Temperature etc., which is presented in figure 1. In the right side of the window ...

5

AN EFFICIENT ALGORITHM FOR VIDEO RESTORATION

AN EFFICIENT ALGORITHM FOR VIDEO RESTORATION

... Moreover, in order to retain the edge structure in each stage structure of missing block is calculated. As shown in Fig. 1(b), the inpainting order for points on extended edges will be similar to that of the original ...

5

An Efficient Algorithm for Document Clustering in Information Retrieval

An Efficient Algorithm for Document Clustering in Information Retrieval

... such that density is similar in each grid. In the next level, it merges the cells having same densities. At this level, the appropriate values of MinPts are also identified in each grid. In the final step, the DBSCAN ...

9

An Efficient Algorithm for Approximate String Matching

An Efficient Algorithm for Approximate String Matching

... differential algorithm, which has complexity in terms of D, the edit ...Myers’ algorithm is not well suited to our ...Myers’ algorithm corresponds to the best case of our algorithm, and its ...

11

AN EFFICIENT AND FAST SUPER RESOLUTION RECONSTRUCTION ALGORITHM

AN EFFICIENT AND FAST SUPER RESOLUTION RECONSTRUCTION ALGORITHM

... 288 | P a g e such as recognition of face and animals. Also, the images containing rich textural regions without dominant structures, such as grass and leaves, which are hard to register using the SIFT descriptors; this ...

10

An Efficient Augmented Context Free Parsing Algorithm

An Efficient Augmented Context Free Parsing Algorithm

... This time, only one leaf node has been created in the parse forest, because both shift actions regarded the word as belonging to the same category, i.e., noun.. After executing "reduce 2[r] ...

16

STF- Energy Efficient Scheduling Algorithm for WSN

STF- Energy Efficient Scheduling Algorithm for WSN

... Fig 3 simply shows the distribution of nodes. Fig 4 shows the average waiting time of nodes calculated in TDMA scheduling and STF scheduling. It can be clearly seen that values of average waiting time for STF scheduling ...

8

An Efficient Symmetric Cipher Algorithm for Data Encryption

An Efficient Symmetric Cipher Algorithm for Data Encryption

... The bitwise XOR is one of the bitwise operators used for manipulating numbers at the binary level. This encryption algorithm or cipher can easily be broken by means of frequency analysis for if the content of a ...

20

Efficient Subgraph Query Algorithm in Large Graph

Efficient Subgraph Query Algorithm in Large Graph

... Abstract. Subgraph query is an important problem in the research and application of large graph mining. For large graphs with symmetry relation substructures, the existing decomposition-join strategy always leads to low ...

6

An Efficient Divide and Conquer Algorithm for Morphological Filters

An Efficient Divide and Conquer Algorithm for Morphological Filters

... divide-and-conquer algorithm is consistent with the one generated by applying the alpha shape method ...divide-and-conquer algorithm achieved superior performances over the original alpha shape ...

6

Show all 10000 documents...

Related subjects