412 search results - page 31 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
141
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
130
Voted
JACM
2000
15 years 3 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
126
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
Robotic manipulators on non-inertial platforms, such as ships, have to endure large inertial forces due to the non-inertial motion of the platform. When the non-inertial platform&#...
110
Voted
SIAMJO
2008
15 years 3 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
128
click to vote
ISQED
2010
IEEE
15 years 5 months ago
2010
IEEE
Recent studies have shown that an attacker can retrieve confidential information from cryptographic hardware (e.g. the secret key) by introducing internal faults. A secure and re...