1461 search results - page 262 / 293 » Complexity of Graph Covering Problems |
ICTAI
2009
IEEE
13 years 5 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
CVIU
2011
12 years 11 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
for a set of operating conditions and coating color formulations, undesirable phenomena like color spitting and coating ribs may be triggered in the Micro-nip during the coating pr...
CSDA
2006
13 years 7 months ago
2006
Generalized additive models (GAM) for modelling nonlinear effects of continuous covariates are now well established tools for the applied statistician. In this paper we develop Ba...