5115 search results - page 765 / 1023 » On Randomized Lanczos Algorithms |
168
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
156
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
167
click to vote
ICNC
2009
Springer
16 years 1 months ago
2009
Springer
A model-free, biologically-motivated learning and control algorithm called S-learning is described as implemented in an Surveyor SRV-1 mobile robot. S-learning demonstrated learni...
155
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...
181
click to vote
ASPDAC
2009
ACM
16 years 29 days ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...