4137 search results - page 217 / 828 » On the number of matchings of a tree |
195
click to vote
ESA
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
164
click to vote
VRST
2003
ACM
15 years 12 months ago
2003
ACM
We investigate several techniques that partition a crowded virtual environment into regions that can be managed by separate servers or mapped onto different multicast groups. When...
164
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
167
click to vote
RT
1997
Springer
15 years 10 months ago
1997
Springer
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
195
click to vote
NLP
2000
15 years 10 months ago
2000
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...