663 search results - page 6 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
ECCV
2010
Springer
14 years 24 days ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
EOR
2008
13 years 7 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
CIAC
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...