Sciweavers

1243 search results - page 9 / 249
» Generating Trees on Multisets
Sort
View
IPL
2000
77views more  IPL 2000»
13 years 9 months ago
Efficient loopless generation of Gray codes for k-ary trees
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
Limin Xiang, Kazuo Ushijima, Changjie Tang
CCECE
2006
IEEE
14 years 3 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
ICASSP
2008
IEEE
14 years 4 months ago
Efficient language model look-ahead probabilities generation using lower order LM look-ahead information
In this paper, an efficient method for language model lookahead probability generation is presented. Traditional methods generate language model look-ahead (LMLA) probabilities fo...
Langzhou Chen, K. K. Chin
FCT
2001
Springer
14 years 2 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
APN
2008
Springer
13 years 11 months ago
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events ar...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...