5153 search results - page 283 / 1031 » Introduction to Randomized Algorithms |
134
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
We provide a review of independent component analysis (ICA) for complex-valued improper and noncircular random sources. An improper random signal is correlated with its complex co...
128
Voted
CIE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
103
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...
135
click to vote
AUSAI
2005
Springer
15 years 9 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
147
click to vote
IPTPS
2003
Springer
15 years 9 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...