8437 search results - page 479 / 1688 » Preferences over Sets |
163
click to vote
DCG
1999
15 years 6 months ago
1999
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
178
click to vote
IANDC
2010
15 years 5 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
150
click to vote
IPL
2010
15 years 5 months ago
2010
In this paper, we re-analyse the Rate Monotonic Scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all t...
178
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
198
click to vote
JMLR
2010
15 years 1 months ago
2010
In this work we propose new ensemble methods for the hierarchical classification of gene functions. Our methods exploit the hierarchical relationships between the classes in diffe...