310 search results - page 29 / 62 » Cutting two graphs simultaneously |
DAMON
2009
Springer
13 years 10 months ago
2009
Springer
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
CGF
2010
13 years 9 months ago
2010
In the style of binary shading, shape and illumination are depicted using two colors, typically black and white, that form coherent lines and regions in the image. We formulate th...
AAAI
2010
13 years 10 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
IJISTA
2008
13 years 9 months ago
2008
: We combine a low resolution time-of-flight depth image camera based on photonic mixer devices with two standard cameras in a stereo configuration. We show that this approach is u...