4843 search results - page 199 / 969 » The Shortcut Problem - Complexity and Approximation |
119
click to vote
HEURISTICS
2007
15 years 3 months ago
2007
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
155
Voted
ADCM
2011
14 years 10 months ago
2011
ABSTRACT. In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric pro...
129
click to vote
TOC
2010
14 years 10 months ago
2010
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
104
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Sparsity of target space in subsurface imaging problem is used within the framework of the compressive sensing (CS) theory in recent publications to decrease the data acquisition ...
158
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...