Sciweavers

1950 search results - page 289 / 390
» Varieties of Increasing Trees
Sort
View
IWPC
2003
IEEE
14 years 3 months ago
Generalized Selective XML Markup of Source Code Using Agile Parsing
Increasingly focus in the software comprehension community is shifting from representing the results of analysis in the graph and database domain to reflecting insights directly i...
James R. Cordy
IWPSE
2003
IEEE
14 years 3 months ago
Automatic Categorization Algorithm for Evolvable Software Archive
The number of software systems is increasing at a rapid rate. For example, SourceForge currently has about sixty thousand software systems registered, twenty-two thousand of which...
Shinji Kawaguchi, Pankaj K. Garg, Makoto Matsushit...
WCRE
2003
IEEE
14 years 3 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
FSTTCS
2003
Springer
14 years 3 months ago
On the Covering Steiner Problem
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
Anupam Gupta, Aravind Srinivasan
CSB
2002
IEEE
109views Bioinformatics» more  CSB 2002»
14 years 3 months ago
Towards Automatic Clustering of Protein Sequences
Analyzing protein sequence data becomes increasingly important recently. Most previous work on this area has mainly focused on building classification models. In this paper, we i...
Jiong Yang, Wei Wang 0010