[PDF] Top 20 Revista ILLAPA nº 7, julio 2010.
Has 10000 "Revista ILLAPA nº 7, julio 2010." found on our website. Below are the top 20 most common "Revista ILLAPA nº 7, julio 2010.".
Fast String Kernels using Inexact Matching for Protein Sequences
... test inexact matching string kernels for a wide range of parameters, in practice, only a small parameter range is biologically motivated for use in the remote protein homology detection ... See full document
8
A New String Matching Algorithm for Searching Biological Sequences
... In this paper, we have presented a new algorithm. The OE algorithm is a fast string matching algorithm. It combines our enhanced preprocessing phase from the Berry Ravindran algorithm with our new ... See full document
32
Implementation of Bit Vector Algorithm for Approximate String Matching on Rhodopsin Protein Sequence
... DNA sequences. Cheng et al. [1] developed an algorithm for approximate string matching in DNA ...DNA sequences in PC clusters. Liu et al. [2] proposed FAAST (fast algorithm for ... See full document
130
A probabilistic framework for mismatch and profile string kernels
... the protein homology problem, which has become a benchmark for the application of string-type ...tailored kernels to be produced, each with a clear method for introducing prior ...the protein ... See full document
5
Code clone detection using string based tree matching technique
... CODE CLONE DETECTION USING STRING BASED STRING BASED TREE MATCHING TECHNIOUE.. Contains confidential information under the Official Secret Act 1972*.[r] ... See full document
18
Code clone detection using string based tree matching technique
... Software maintenance has been widely accepted as the most costly phase of a software lifecycle, with figures as high as 80% of the total development cost being reported (Baker, 1995). As cloning is one of the ... See full document
9
Parallel string matching for image matching with prime method
... Abstract:- String matching play the much more attention in the recent days because of its importance in several areas like retrieval of large text data, image data , mining ... See full document
71
SPELL CHECKER AND STRING MATCHING USING BK-TREES
... by using a BK tree we can reduce this time complexity in the following manner; assuming tolerance limit(T) to be ...the string in our dictionary and N2 is the length of the incorrect ... See full document
6
An Image Matching Approach based on String Matching using Remainder Prime Method
... is fast and accurate for document image ...image matching. It is an image matching technique based on ...form using an image scanner and can be store in form of digital library for public ... See full document
26
Nonextensive Information Theoretic Kernels on Measures
... The paper is organized as follows. Section 2 reviews nonextensive entropies, with empha- sis on the Tsallis case. Section 3 discusses Jensen differences and divergences. The concepts of q-differences and q-convexity are ... See full document
10
Modeling Organization in Student Essays
... Owing to the different ways we presented of com- bining the scores of an essay’s nearest neighbors, the paragraph label sequence alignment approach has three variants, and its sentence label sequence alignment ... See full document
16
Automated essay scoring with string kernels and word embeddings
... duce search cost. The centroid of each cluster is interpreted as a super word embedding or super word vector that embodies all the semantically re- lated word vectors in a small region of the embed- ding space. Every ... See full document
66
SWiM: Secure Wildcard Pattern Matching From OT Extension
... To our knowledge, PEQT was first introduced in 1996 by Fagin, Naor, and Winkler [FNW96]. Follow-up works[NP99, BST01, Lip03] improved the efficiency of PEQT, while still relying on expensive public-key operations. PEQT ... See full document
5
Pattern matching of signature-based IDS using Myers algorithm under MapReduce framework
... Pattern matching is the most intensive task in the detec- tion process in terms of CPU time and ...the matching pro- ...algorithm using dif- ferent MapReduce implementations on a multi-core ...Myers ... See full document
31
An Efficient Algorithm for Approximate String Matching
... String alignment algorithms have not been covered in the work, but the longest common subsequence problem has a huge potential in this area. FASTA and BLAST algorithms and its modifications are used for genetic, ... See full document
77
String Matching on Multicontext FPGA using Dynamic Partial Reconfiguration
... performed using multicontext FPGAs and how to efficiently realize the above approach through the application snort ruleset based IDS with BM string matching ...by using snort ...and ... See full document
112
Kernel Methods for Activation Energy Prediction
... In this report, we are interested in predicting the activation energy of a reaction based on information about the reactants using machine learning techniques. Feature engineering is always a key part of algorithm ... See full document
19
|P| ) time where |P| is
... Abstract—String matching and dynamic dictionary matching are significant principles in computer ...dictionary matching, the structure is able to insert or delete the individual patterns over ... See full document
647
Using String Kernels for Learning Semantic Parsers
... From these derivations, positive and negative examples are collected for the next iteration. Pos- itive examples are collected from the most prob- able derivation which gives the correct MR, fig- ure 3 showed an example ... See full document
152
String Kernels, Fisher Kernels and Finite State Automata
... Our experiments were conducted on the top 10 categories of the standard Reuters- 21578 data set using the “Mod Apte” split. We compared the standard n-gram kernel with a Uniform, non-uniform and ln weighting ... See full document
190
Related subjects