2693 search results - page 110 / 539 » On Computing Complex Navigation Functions |
107
click to vote
LSSC
2005
Springer
15 years 7 months ago
2005
Springer
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
141
click to vote
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
119
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
127
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
108
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...