962 search results - page 3 / 193 » Some Reducibilities on Regular Sets |
ICFCA
2007
Springer
14 years 1 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
WEBDB
2000
Springer
13 years 11 months ago
2000
Springer
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
DLT
2003
13 years 9 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
ACTA
2006
13 years 7 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
EJC
2008
13 years 7 months ago
2008
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...