501 search results - page 33 / 101 » Rough Sets and Approximation Schemes |
ICALP
1998
Springer
14 years 2 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
ISIPTA
2005
IEEE
14 years 3 months ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...
CCCG
2007
13 years 11 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
ICIP
2005
IEEE
14 years 11 months ago
2005
IEEE
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....