780 search results - page 42 / 156 » Reasoning about sets using redescription mining |
140
click to vote
FMCAD
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
130
click to vote
VLDB
1995
ACM
15 years 7 months ago
1995
ACM
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
152
click to vote
KI
2005
Springer
15 years 9 months ago
2005
Springer
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...
121
Voted
LREC
2010
15 years 5 months ago
2010
This paper proposes the method to detect peculiar examples of the target word from a corpus. The peculiar example is regarded as an outlier in the given example set. Therefore we ...
128
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....