Sciweavers

705 search results - page 43 / 141
» Approximating Extended Answer Sets
Sort
View
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 9 months ago
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
M. A. Iwen
FUIN
2002
108views more  FUIN 2002»
14 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
APPROX
2010
Springer
160views Algorithms» more  APPROX 2010»
14 years 10 months ago
Proximity Algorithms for Nearly-Doubling Spaces
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
Lee-Ad Gottlieb, Robert Krauthgamer
AAMAS
2011
Springer
14 years 4 months ago
Aggregating value ranges: preference elicitation and truthfulness
We study the case where agents have preferences over ranges (intervals) of values, and we wish to elicit and aggregate these preferences. For example, consider a set of climatologi...
Joseph Farfel, Vincent Conitzer
SEMWEB
2007
Springer
15 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