Sciweavers

2520 search results - page 50 / 504
» The complexity of approximating entropy
Sort
View
SOFSEM
2010
Springer
15 years 6 months ago
On the Complexity of the Highway Pricing Problem
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
Alexander Grigoriev, Joyce van Loon, Marc Uetz
AIIA
1991
Springer
15 years 1 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
AIME
2007
Springer
15 years 4 months ago
On the Behaviour of Information Measures for Test Selection
In diagnostic decision-support systems, a test-selection facility serves to select tests that are expected to yield the largest decrease in the uncertainty about a patient’s diag...
Danielle Sent, Linda C. van der Gaag
JUCS
2002
131views more  JUCS 2002»
14 years 9 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
ICIP
2000
IEEE
15 years 2 months ago
EBWIC: A low Complexity and Efficient Rate Constrained Wavelet Image Coder
Efficient compression algorithms generally use wavelet transforms. They try to exploit all the signal dependencies that can appear inside and across the different sub-bands of th...
Christophe Parisot, Marc Antonini, Michel Barlaud