Sciweavers

129
Voted
ECML
2004
Springer
15 years 7 months ago
Justification-Based Selection of Training Examples for Case Base Reduction
Maintaining compact and competent case bases has become a main topic of Case Based Reasoning (CBR) research. The main goal is to obtain a compact case base (with a reduced number o...
Santiago Ontañón, Enric Plaza
109
Voted
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
15 years 7 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
CIAC
2006
Springer
75views Algorithms» more  CIAC 2006»
15 years 7 months ago
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
127
Voted
CIAC
2006
Springer
76views Algorithms» more  CIAC 2006»
15 years 7 months ago
Universal Relations and #P-Completeness
Hervé Fournier, Guillaume Malod
138
Voted
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 7 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ