16404 search results - page 810 / 3281 » A set coverage problem |
199
click to vote
NIPS
2008
15 years 9 months ago
2008
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
217
click to vote
IJCAI
2003
15 years 9 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
237
click to vote
IJCAI
2003
15 years 9 months ago
2003
In traditional text classification, a classifier is built using labeled training documents of every class. This paper studies a different problem. Given a set P of documents of a ...
184
click to vote
AMW
2009
15 years 8 months ago
2009
Abstract. This paper introduces a formalization of a set of spatial semantic integrity constraints on an extended-relational database model. The formalization extends traditional n...
169
click to vote
ANOR
2008
15 years 7 months ago
2008
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...