1322 search results - page 48 / 265 » Parameterized counting problems |
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. In many vision problems, the observed data lies in a nonlinear manifold in a high-dimensional space. This paper presents a generic modelling scheme to characterize the no...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
ATVA
2004
Springer
14 years 2 months ago
2004
Springer
— This paper considers the state feedback control of parameterized discrete event systems consisting of N similar processes for the problem of maintaining a predicate on the stat...
JDA
2007
13 years 8 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...