390 search results - page 6 / 78 » Set Intersection Theorems and Existence of Optimal Solutions |
CP
2009
Springer
14 years 2 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
COMBINATORICA
2011
12 years 7 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
EOR
2006
13 years 7 months ago
2006
Sensitivity analysis is one of the most interesting and preoccupying areas in optimization. Many attempts are made to investigate the problem's behavior when the input data c...