736 search results - page 47 / 148 » High-order functions and their ordering relations |
102
click to vote
LORI
2009
Springer
15 years 6 months ago
2009
Springer
Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for the...
111
click to vote
ISCAS
2005
IEEE
15 years 5 months ago
2005
IEEE
— In the context of Independent Component Analysis (ICA), we propose a simple method for online estimation of activation functions in order to blindly separate instantaneous mixt...
FSTTCS
2001
Springer
15 years 4 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
105
click to vote
IDA
2005
Springer
15 years 5 months ago
2005
Springer
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
FLOPS
2006
Springer
15 years 3 months ago
2006
Springer
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...