17129 search results - page 3425 / 3426 » Applied Computing |
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
EUROSYS
2006
ACM
14 years 1 months ago
2006
ACM
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
ACISP
2009
Springer
13 years 11 months ago
2009
Springer
Bernstein’s CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
COLING
1990
13 years 5 months ago
1990
This paper presents some techniques that provide a standard parsing system for the analysis of ill-formed utterances. These techniques are feature generalization and heuristically...