27 search results - page 6 / 6 » Visualizing SAT Instances and Runs of the DPLL Algorithm |
COCO
2004
Springer
13 years 9 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
TCSV
2008
13 years 5 months ago
2008
Abstract--Modeling background and segmenting moving objects are significant techniques for video surveillance and other video processing applications. Most existing methods of mode...