16430 search results - page 566 / 3286 » On Computable Tree Functions |
193
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical r...
159
click to vote
BMCBI
2006
15 years 7 months ago
2006
nd: The need to depict a phylogeny, or some other kind of abstract tree, is very frequently experienced by researchers from a broad range of biological and computational disciplin...
169
click to vote
COMGEO
2007
ACM
15 years 7 months ago
2007
ACM
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
179
click to vote
TKDE
2008
15 years 7 months ago
2008
Phrase has been considered as a more informative feature term for improving the effectiveness of document clustering. In this paper, we propose a phrase-based document similarity t...
174
click to vote
CG
2002
Springer
15 years 7 months ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...