4137 search results - page 173 / 828 » On the number of matchings of a tree |
180
click to vote
IPSN
2005
Springer
16 years 2 days ago
2005
Springer
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
132
click to vote
ACL
1992
15 years 7 months ago
1992
We present a new compositional tense-aspect deindexing mechanism that makes use of tense trees as components of discourse contexts. The mechanism allows reference episodes to be c...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally in...
158
click to vote
JCT
2008
15 years 6 months ago
2008
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...
181
click to vote
BIBE
2007
IEEE
16 years 28 days ago
2007
IEEE
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...