1272 search results - page 86 / 255 » The Set Cover with Pairs Problem |
128
Voted
IPCO
2010
15 years 5 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
111
Voted
JAL
2002
15 years 3 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
142
Voted
FSS
2008
15 years 3 months ago
2008
This paper introduces a new approach to classification which combines pairwise decomposition techniques with ideas and tools from fuzzy preference modeling. More specifically, our...
138
Voted
ISBI
2006
IEEE
16 years 4 months ago
2006
IEEE
Mutual information (MI) based image-registration methods that use histograms are known to suffer from the so-called binning problem, caused by the absence of a principled techniqu...
160
Voted
SCN
2004
Springer
15 years 9 months ago
2004
Springer
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...