Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

S. Y. Lu

dblp:65/8715 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1991
0009-0009-5285-2903ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › recursive algorithms
divide-and-conquer
0.011984
A Tree-Matching Algorithm Based on Node Splitting and Merging · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Algorithms and data structures › sequence algorithms › string algorithms
tree edit distance
0.011984
A Tree-Matching Algorithm Based on Node Splitting and Merging · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Algorithms and data structures › combinatorial algorithms
tree matching
0.011984
A Tree-Matching Algorithm Based on Node Splitting and Merging · IEEE Trans. Pattern Anal. Mach. Intell. 1984

Methods — techniques the papers use, named apart from their topics

divide-and-conquer · 0.0
YearPublicationVenuePosition
1991 Ship wake-detection procedure using conjugate gradient trained artificial neural networks
abstract
A method has been developed to reduce large two-dimensional images to significantly smaller feature lists. These feature lists overcome the problem of storing and manipulating large amounts of data. A new artificial neural network using conjugate gradient training methods, operating on sets of feature lists, was successfully trained to determine the presence or absence of wakes in synthetic aperture radar images. A comparison has been made between the different conjugate gradient and steepest-descent training methods and has demonstrated the superiority of the former over the latter.>
J. Patrick Fitch, Sean K. Lehman, Farid U. Dowla, S. Y. Lu, Erik M. Johansson, Dennis M. Goodman
IEEE Trans. Geosci. Remote. Sens.4
1984 A Tree-Matching Algorithm Based on Node Splitting and Merging
abstract
An algorithm that computes the best matching of two trees is described. The degree of mismatch, i.e., the distance, is measured in terms of the number of node splitting and merging operations required. The proposed tree distance is a more appropriate measurement of structural defonnation than the tree distance measure in terms of the number of insertions, deletions, and substitutions of tree nodes, as defined in previous studies. An algorithm that uses a divide-and-conquer strategy is presented. The analysis shows that the time complexity is O(NM2) where N and Al are the number of nodes of the two trees, respectively. The algorithm has been implemented on a VAX 11/780.
S. Y. Lu
IEEE Trans. Pattern Anal. Mach. Intell.1
1979 Size Normalization and Pattern Orientation Problems in Syntactic Clustering
K. S. Fu, S. Y. Lu
IEEE Trans. Syst. Man Cybern.2