373 search results - page 8 / 75 » Counting in Trees for Free |
126
click to vote
JOLLI
2006
14 years 11 months ago
2006
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
110
click to vote
HPCA
2012
IEEE
13 years 6 months ago
2012
IEEE
Conventional out-of-order processors that use a unified physical register file allocate and reclaim registers explicitly using a free list that operates as a circular queue. We ...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
FOCM
2006
14 years 11 months ago
2006
We present an approach that allows performing computations related to the Baker-Campbell-Haussdorff (BCH) formula and its generalizations in an arbitrary Hall basis, using labeled...
EMMCVPR
2001
Springer
15 years 3 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...