1322 search results - page 88 / 265 » Parameterized counting problems |
115
Voted
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
105
click to vote
AAAI
1997
15 years 4 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
105
Voted
IJCAI
1989
15 years 3 months ago
1989
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
125
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a dynamic inference algorithm in a globally parameterized nonlinear manifold and demonstrate it on the problem of visual tracking. An appearance manifold is usually non...
89
Voted
AUTOMATICA
2008
15 years 2 months ago
2008
In this paper, the identification of a class of nonlinear systems which admits input-output maps described by a finite degree Volterra series is considered. In actual fact, it app...