1743 search results - page 208 / 349 » Generalized Modal Satisfiability |
139
click to vote
PKDD
1999
Springer
15 years 8 months ago
1999
Springer
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
137
click to vote
TACS
1994
Springer
15 years 7 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
128
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
142
click to vote
COCO
2004
Springer
15 years 7 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...
147
click to vote
DIS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We propose an approach to subgroup discovery using distribution rules (a kind of association rules with a probability distribution on the consequent) for numerical proper...