1331 search results - page 171 / 267 » Complexity bounds for zero-test algorithms |
137
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
158
click to vote
AUTOMATICA
2008
15 years 3 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
160
click to vote
SIES
2009
IEEE
15 years 10 months ago
2009
IEEE
—We introduce variable-bandwidth servers (VBS) for scheduling and executing processes under programmable temporal isolation. A VBS is an extension of a constant-bandwidth server ...
119
click to vote
HAPTICS
2002
IEEE
15 years 8 months ago
2002
IEEE
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
163
click to vote
ALT
2011
Springer
14 years 3 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...