147 search results - page 10 / 30 » Logarithmic keying |
COCO
2007
Springer
14 years 4 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
FS
2006
13 years 9 months ago
2006
Fads models were introduced by Shiller (1984) and Summers (1986) as plausible alternatives to the efficient markets/constant expected returns assumptions. Under these models, loga...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
COMPSEC
2000
13 years 9 months ago
2000
Peyravian and Zunic (2000) proposed a password transmission scheme and a password change scheme over an insecure network. Their proposed solutions do not require the use of any sym...
CSDA
2008
13 years 10 months ago
2008
The finite sample properties of the Fourier estimator of integrated volatility under market microstructure noise are studied. Analytic expressions for the bias and the mean square...