16404 search results - page 742 / 3281 » A set coverage problem |
193
click to vote
PAKDD
2005
ACM
16 years 28 days ago
2005
ACM
Traditional multiple query optimization methods focus on identifying common subexpressions in sets of relational queries and on constructing their global execution plans. In this p...
201
click to vote
ICML
2004
IEEE
16 years 26 days ago
2004
IEEE
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
160
click to vote
ISMIS
2003
Springer
16 years 19 days ago
2003
Springer
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
182
click to vote
CSR
2010
Springer
16 years 7 days ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
173
click to vote
ECP
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...