16404 search results - page 731 / 3281 » A set coverage problem |
212
click to vote
SIGECOM
2004
ACM
16 years 24 days ago
2004
ACM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
188
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
192
click to vote
CVPR
2001
IEEE
16 years 9 months ago
2001
IEEE
The Error Correcting Output Coding (ECOC) approach to classifier design decomposes a multi-class problem into a set of complementary two-class problems. We show how to apply the E...
197
click to vote
ECCV
2004
Springer
16 years 9 months ago
2004
Springer
Abstract. We address the problem of selecting a subset of the most relevant features from a set of sample data in cases where there are multiple (equally reasonable) solutions. In ...
255
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...