490 search results - page 25 / 98 » Equivalent Keys of HPC |
104
Voted
ECML
2007
Springer
15 years 5 months ago
2007
Springer
Class binarizations are effective methods for improving weak learners by decomposing multi-class problems into several two-class problems. This paper analyzes how these methods can...
AML
2008
15 years 1 months ago
2008
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
116
click to vote
SIAMJO
2008
15 years 1 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
135
Voted
TOPNOC
2008
15 years 1 months ago
2008
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
93
Voted
CG
2004
Springer
15 years 1 months ago
2004
Springer
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...