3455 search results - page 485 / 691 » Generalized Game Trees |
182
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
157
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
149
click to vote
PADL
2001
Springer
15 years 11 months ago
2001
Springer
The goal of this project is to develop solutions to enhance interoperability between bioinformatics applications. Most existing applications adopt different data formats, forcing ...
173
click to vote
WABI
2001
Springer
15 years 11 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
137
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
A novel method which can be regarded as the noisecounterpart of the celebrated Elmore’s delay formula— both being based on the first two moments of the network’s transfer fu...