4702 search results - page 151 / 941 » How to Copyright a Function |
166
click to vote
AISC
2004
Springer
15 years 8 months ago
2004
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
127
click to vote
EUSFLAT
2003
15 years 5 months ago
2003
A generalized dice model for the pairwise comparison of non-necessarily independent random variables is established. It is shown how the transitivity of the probabilistic relation...
136
click to vote
TCS
2002
15 years 4 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
154
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative fil...
143
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...