86 search results - page 12 / 18 » Polynomial Constraints for Sets with Cardinality Bounds |
96
Voted
ICPR
2004
IEEE
16 years 23 days ago
2004
IEEE
Given a collection of sets of 2-D views of 3-D objects and a similarity measure between them, we present a method for summarizing the sets using a small subset called a bounded ca...
110
click to vote
KI
2007
Springer
15 years 5 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
ASPDAC
2008
ACM
15 years 1 months ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...