187 search results - page 7 / 38 » On the uniform edge-partition of a tree |
102
click to vote
COLING
1992
15 years 2 months ago
1992
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
118
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
108
click to vote
COMBINATORICS
2006
15 years 1 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
110
click to vote
ISAAC
1998
Springer
15 years 5 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
187
click to vote
WAE
2001
15 years 2 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...