5580 search results - page 681 / 1116 » Randomized priority algorithms |
118
click to vote
COLING
1996
15 years 5 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
158
click to vote
DAGSTUHL
1996
15 years 5 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...
146
click to vote
GI
2008
Springer
15 years 5 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...
142
click to vote
ICML
2010
IEEE
15 years 5 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...
ICASSP
2010
IEEE
15 years 4 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...