1097 search results - page 154 / 220 » Testing Graph Isomorphism |
111
Voted
HM
2007
Springer
15 years 8 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
106
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
139
click to vote
NIPS
2007
15 years 3 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
134
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper, we propose a framework that fuses multiple features for improved action recognition in videos. The fusion of multiple features is important for recognizing actions ...
119
click to vote
KBSE
1995
IEEE
15 years 6 months ago
1995
IEEE
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...