AbstractComputational problems originating from approximations of Choquet capacities are discussed. Upper bounds for capacities result in a data compression scheme for matrices. Approximations are formed in the sense of the maximum metric
International audienceThis article investigates the theoretical convergence properties of the estima...
We give the exact upper and lower bounds of the Mobius inverse of monotone and normalized set functi...
In the Boolean maximum constraint satisfaction problem - Max CSP(?) - one is given a collection of w...
AbstractComputational problems originating from approximations of Choquet capacities are discussed. ...
AbstractWe develop a method for computing capacity based on energy minimization. The method applies ...
AbstractWe introduce a method for computing the weighted capacity of a closed plane set. The method ...
International audienceWe give the exact upper and lower bounds of the Möbius inverse of monotone and...
International audienceWe give the exact upper and lower bounds of the Möbius inverse of monotone and...
International audienceWe give the exact upper and lower bounds of the Möbius inverse of monotone and...
AbstractWe consider the class M of monotonically increasing binary output functions. M has considera...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceThis article investigates the theoretical convergence properties of the estima...
We give the exact upper and lower bounds of the Mobius inverse of monotone and normalized set functi...
In the Boolean maximum constraint satisfaction problem - Max CSP(?) - one is given a collection of w...
AbstractComputational problems originating from approximations of Choquet capacities are discussed. ...
AbstractWe develop a method for computing capacity based on energy minimization. The method applies ...
AbstractWe introduce a method for computing the weighted capacity of a closed plane set. The method ...
International audienceWe give the exact upper and lower bounds of the Möbius inverse of monotone and...
International audienceWe give the exact upper and lower bounds of the Möbius inverse of monotone and...
International audienceWe give the exact upper and lower bounds of the Möbius inverse of monotone and...
AbstractWe consider the class M of monotonically increasing binary output functions. M has considera...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceMonotone capacities (on finite sets) of finite or infinite order (lower probab...
International audienceThis article investigates the theoretical convergence properties of the estima...
We give the exact upper and lower bounds of the Mobius inverse of monotone and normalized set functi...
In the Boolean maximum constraint satisfaction problem - Max CSP(?) - one is given a collection of w...
DOI
Add to ORKG