2354 search results - page 145 / 471 » Radio number for trees |
161
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...
165
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...
188
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...
160
click to vote
DAM
2008
15 years 6 months ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
163
click to vote
ICIP
1994
IEEE
16 years 8 months ago
1994
IEEE
ABSTRACT the pyramid. Recently, a number of promising quanMultiresolution imagedecompositions (e. g., wavelets), in conjunction with a variety of quantization schemes, have been sh...