4137 search results - page 229 / 828 » On the number of matchings of a tree |
168
click to vote
SIROCCO
2010
15 years 8 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
190
click to vote
CVIU
2004
15 years 6 months ago
2004
The content of an image can be summarized by a set of homogeneous regions in an appropriate feature space. When exact shape is not important, the regions can be represented by sim...
219
click to vote
JUCS
2010
15 years 5 months ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
158
click to vote
JSYML
2000
15 years 6 months ago
2000
We deal with several pcf problems; we characterize another version of exponentiation: number of -branches in a tree with nodes, deal with existence of independent sets in stable t...
169
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...