2219 search results - page 37 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
119
click to vote
JDA
2010
14 years 8 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
115
click to vote
SODA
1994
ACM
15 years 3 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
136
click to vote
FMOODS
2003
15 years 3 months ago
2003
This work aims to extend the algebraical approach to graph transformation to model object-oriented systems structures and computations. A graph grammar based formal framework for o...
118
click to vote
ACIVS
2008
Springer
15 years 8 months ago
2008
Springer
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
112
click to vote
EOR
2008
15 years 2 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...