4137 search results - page 293 / 828 » On the number of matchings of a tree |
175
click to vote
TMC
2002
15 years 6 months ago
2002
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
213
click to vote
COR
2008
15 years 6 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
224
click to vote
PAMI
2011
15 years 1 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
211
click to vote
WISE
2007
Springer
16 years 1 months ago
2007
Springer
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
216
click to vote
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...