4137 search results - page 204 / 828 » On the number of matchings of a tree |
182
click to vote
ADC
2009
Springer
15 years 10 months ago
2009
Springer
Radio Frequency Identification (RFID) technology uses radio-frequency waves to automatically identify people or objects. A large volume of data, resulting from the fast capturing ...
169
Voted
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
170
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
202
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
160
click to vote
CNSR
2006
IEEE
16 years 20 days ago
2006
IEEE
Abstract— This paper presents a study of our proposed architecture for the setup of a MultiPoint-to-MultiPoint (MP2MP) Label Switched Path (LSP). This form of LSP is needed for e...