359 search results - page 26 / 72 » The Parameterized Complexity of Counting Problems |
80
Voted
IPPS
2007
IEEE
15 years 4 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...
90
Voted
CPC
2000
14 years 10 months ago
2000
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
102
Voted
FOSSACS
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
88
Voted
IVA
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...
89
Voted
FCT
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...