5115 search results - page 589 / 1023 » On Randomized Lanczos Algorithms |
198
click to vote
DAGSTUHL
1996
15 years 8 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
180
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
189
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Deep Belief Networks (DBNs) are hierarchical generative models which have been used successfully to model high dimensional visual data. However, they are not robust to common vari...
134
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Sub-Nyquist systems capture the signal information in a different fashion than uniform high-rate samples. Consequently, digital processing, which is the prime reason for leaving t...
149
click to vote
ACTAC
2007
15 years 6 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...