Sciweavers

1486 search results - page 151 / 298
» Algorithms for two-box covering
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Learning structural SVMs with latent variables
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
Chun-Nam John Yu, Thorsten Joachims
ISSAC
2009
Springer
120views Mathematics» more  ISSAC 2009»
15 years 11 months ago
A non-holonomic systems approach to special function identities
We extend Zeilberger’s approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals...
Frédéric Chyzak, Manuel Kauers, Brun...
CEC
2005
IEEE
15 years 10 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
ISIPTA
2005
IEEE
157views Mathematics» more  ISIPTA 2005»
15 years 10 months ago
Possibilistic Networks with Locally Weighted Knowledge Bases
Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility ...
Salem Benferhat, Salma Smaoui
IPPS
1998
IEEE
15 years 8 months ago
PACE: Processor Architectures for Circuit Emulation
We describe a family of reconfigurable parallel architectures for logic emulation. They are supposed to be applicable like conventional FPGAs, while covering a larger range of circ...
Reiner Kolla, Oliver Springauf