16404 search results - page 286 / 3281 » A set coverage problem |
194
click to vote
WG
2004
Springer
15 years 10 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
115
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
141
click to vote
RSKT
2009
Springer
15 years 9 months ago
2009
Springer
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...
151
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentatio...
150
click to vote
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...