Sciweavers

8824 search results - page 55 / 1765
» On the Complexity of Real Functions
Sort
View
CPHYSICS
2011
232views Education» more  CPHYSICS 2011»
14 years 6 months ago
A nested Krylov subspace method to compute the sign function of large complex matrices
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
Jacques Bloch, Simon Heybrock
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 6 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
16 years 1 months ago
Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity
The paper proposes an extension of CFDs [1], referred to as extended Conditional Functional Dependencies (eCFDs). In contrast to CFDs, eCFDs specify patterns of semantically relate...
Loreto Bravo, Wenfei Fan, Floris Geerts, Shuai Ma
FCT
1991
Springer
15 years 3 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
JC
2011
87views more  JC 2011»
14 years 6 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski