Sciweavers

169 search results - page 8 / 34
» Local similarity between quotiented ordered trees
Sort
View
BMCBI
2004
125views more  BMCBI 2004»
13 years 8 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner
NLPRS
2001
Springer
14 years 1 months ago
Hierarchical Phrase Alignment Harmonized with Parsing
In this paper, we propose a hierarchical phrase alignment method that aims to acquire translation knowledge. Previous methods utilize the correspondence of sub-trees between bilin...
Kenji Imamura
ICSE
2012
IEEE-ACM
11 years 11 months ago
Where should the bugs be fixed? More accurate information retrieval-based bug localization based on bug reports
—For a large and evolving software system, the project team could receive a large number of bug reports. Locating the source code files that need to be changed in order to fix th...
Jian Zhou, Hongyu Zhang, David Lo
CADE
2000
Springer
14 years 1 months ago
Machine Instruction Syntax and Semantics in Higher Order Logic
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
Neophytos G. Michael, Andrew W. Appel
ICIP
2005
IEEE
14 years 10 months ago
Exploiting discriminant information in elastic graph matching
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
Stefanos Zafeiriou, Anastasios Tefas, Ioannis Pita...