2374 search results - page 78 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
IJON
2006
13 years 10 months ago
2006
There is a trend to develop blind or semi-blind source extraction algorithms based on second-order statistics, due to its low computation load and fast processing speed. An import...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
DAC
2001
ACM
14 years 11 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
FOCS
2000
IEEE
14 years 2 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...