2168 search results - page 29 / 434 » Randomized Algorithms and Complexity Theory |
141
click to vote
VOSS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
143
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
182
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
125
click to vote
ESANN
2007
15 years 6 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
126
click to vote
JCP
2007
15 years 5 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...