2736 search results - page 221 / 548 » Implementable allocation rules |
161
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
169
click to vote
GLVLSI
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents an improved Tree-based architecture that unifies two unidirectional programmable networks: A predictible downward network based on the Butterfly-FatTree topolo...
205
click to vote
ENTCS
2008
15 years 6 months ago
2008
The type theory P corresponds to the logical framework LF. In this paper we present H, a variant of P where convertibility is not implemented by means of the customary conversion ...
147
click to vote
ENTCS
2008
15 years 6 months ago
2008
Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and...
191
click to vote
ACTA
2005
15 years 6 months ago
2005
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols,...