3779 search results - page 17 / 756 » Linear Consistency Testing |
106
click to vote
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
ECCC
2011
14 years 1 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
ENTCS
2008
14 years 10 months ago
2008
In [24] the authors studied the expressiveness of persistence in the asynchronous -calculus (A) wrt weak barbed congruence. The study is incomplete because it ignores the issue of...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
It has been shown that the delay of a target path can be composed linearly of other path delays. If the later paths are robustly testable (with known delay values), the target pat...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We consider the least-square regression problem with regularization by a block 1-norm, that is, a sum of Euclidean norms over spaces of dimensions larger than one. This problem, r...