224 search results - page 34 / 45 » G-graphs for the cage problem: a new upper bound |
147
click to vote
PAMI
2006
15 years 6 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
164
click to vote
AIPS
2008
15 years 8 months ago
2008
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
164
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
272
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
148
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Medial axis transform (MAT) is a basic tool for shape analysis. But, in spite of its usefulness, it has some drawbacks, one of which is its instability under the boundary perturba...