129 search results - page 7 / 26 » A Graph Reduction Method for 2D Snake Problems |
TASE
2008
IEEE
14 years 1 months ago
2008
IEEE
Symmetry reduction holds great promise to counter the state explosion problem. However, currently it is “conducting a life on the fringe”, and is not widely applied, mainly du...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...
SMA
2003
ACM
14 years 24 days ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
DAC
2009
ACM
13 years 11 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...