115 search results - page 5 / 23 » Algebras Defined from Ordered Sets and the Varieties they Ge... |
ML
2002
ACM
14 years 9 months ago
2002
ACM
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
SIGMOD
1996
ACM
15 years 1 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
79
Voted
CONSTRAINTS
2008
14 years 9 months ago
2008
We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of se...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
EUROCAST
2007
Springer
15 years 1 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...