1830 search results - page 143 / 366 » Workshop on Graph Computation Models |
158
click to vote
CVPR
2010
IEEE
16 years 18 days ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
179
click to vote
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
123
click to vote
MFCS
1997
Springer
15 years 8 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
231
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
130
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...