1225 search results - page 6 / 245 » Maximal Consistent Subsets |
IPL
2011
13 years 2 months ago
2011
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
SUM
2010
Springer
13 years 5 months ago
2010
Springer
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
CIARP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. A major characteristic of text document categorization problems is the extremely high dimensionality of text data. In this paper we explore the usability of the Oscillati...
VTC
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...