Sciweavers

218 search results - page 2 / 44
» Composite Binary Losses
Sort
View
ICWS
2010
IEEE
13 years 8 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke
DEXA
2006
Springer
80views Database» more  DEXA 2006»
13 years 11 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
ECAI
2004
Springer
14 years 23 days ago
A Generalized Quadratic Loss for Support Vector Machines
The standard SVM formulation for binary classification is based on the Hinge loss function, where errors are considered not correlated. Due to this, local information in the featu...
Filippo Portera, Alessandro Sperduti
ISSAC
1990
Springer
60views Mathematics» more  ISSAC 1990»
13 years 11 months ago
Normal Forms in Function Fields
We consider function fields of functions of one variable augmented by the binary operation of composition of functions. It is shown that the straightforward axiom
Karl Aberer
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 7 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir