270 search results - page 40 / 54 » Matching graphs of Hypercubes and Complete Bipartite Graphs |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
COCO
2010
Springer
14 years 15 days ago
2010
Springer
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
MIR
2004
ACM
14 years 2 months ago
2004
ACM
This paper proposes a new approach and algorithm for the similarity measure of video clips. The similarity is mainly based on two bipartite graph matching algorithms: maximum matc...
TAGT
1998
Springer
14 years 24 days ago
1998
Springer
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
ENTCS
2008
13 years 8 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...