Sciweavers

2477 search results - page 52 / 496
» Approximate extended formulations
Sort
View
FUIN
2002
108views more  FUIN 2002»
13 years 9 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
FOCM
2010
97views more  FOCM 2010»
13 years 8 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski
SEMWEB
2007
Springer
14 years 3 months ago
Approximate Measures of Semantic Dissimilarity under Uncertainty
Abstract. We propose semantic distance measures based on the criterion of approximate discernibility and on evidence combination. In the presence of incomplete knowledge, the dista...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
DGCI
2009
Springer
14 years 2 months ago
Pixel Approximation Errors in Common Watershed Algorithms
Abstract. The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but is slow and only works in 2D. On the other hand, ...
Hans Meine, Peer Stelldinger, Ullrich Köthe
WAE
2000
103views Algorithms» more  WAE 2000»
13 years 11 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel