Sciweavers

5 search results - page 1 / 1
» Engineering Tree Labeling Schemes: A Case Study on Least Com...
Sort
View
ESA
2008
Springer
119views Algorithms» more  ESA 2008»
13 years 8 months ago
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
Saverio Caminiti, Irene Finocchi, Rossella Petresc...
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 15 days ago
Average Case Analysis for Tree Labelling Schemes
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
TKDE
2008
153views more  TKDE 2008»
13 years 7 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
IWPSE
2005
IEEE
14 years 18 days ago
Evolution and Growth in Large Libre Software Projects
Software evolution research has recently focused on new development paradigms, studying whether laws found in more classic development environments also apply. Previous works have...
Gregorio Robles, Juan José Amor, Jesú...
DAC
2003
ACM
14 years 8 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik