482 search results - page 60 / 97 » A Linear-Time Graph Kernel |
ISCAS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
115
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
101
click to vote
TSP
2008
14 years 11 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
118
click to vote
CG
2004
Springer
14 years 11 months ago
2004
Springer
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...