4137 search results - page 245 / 828 » On the number of matchings of a tree |
156
click to vote
EJC
2000
15 years 8 months ago
2000
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
169
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
164
click to vote
TCS
2008
15 years 6 months ago
2008
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
167
click to vote
DCG
1999
15 years 6 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
195
click to vote
ACL
2010
2010
Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression
15 years 4 months ago
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution grammar (STSG) for monolingual translation tasks such as sentence compression a...