Sciweavers

4137 search results - page 131 / 828
» On the number of matchings of a tree
Sort
View
ICASSP
2008
IEEE
16 years 28 days 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
ANTSW
2004
Springer
15 years 12 months ago
Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
James Montgomery, Marcus Randall, Tim Hendtlass
IPPS
2002
IEEE
15 years 11 months ago
Fault Recovery for a Distributed SP-Based Delay Constrained Multicast Routing Algorithm
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
Hasan Ural, Keqin Zhu
INFOCOM
1996
IEEE
15 years 10 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
CGF
1999
86views more  CGF 1999»
15 years 6 months ago
Generalized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...
Jihad El-Sana, Amitabh Varshney