2168 search results - page 160 / 434 » Randomized Algorithms and Complexity Theory |
117
Voted
TCS
1998
15 years 3 months ago
1998
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
132
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
137
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
137
Voted
AVSS
2006
IEEE
15 years 9 months ago
2006
IEEE
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
108
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...