2252 search results - page 248 / 451 » Lower Bounds for Dynamic Algorithms |
136
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
125
Voted
TCS
2008
15 years 3 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
164
Voted
OPODIS
2010
15 years 1 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
105
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
A variational Bayesian framework is employed in the paper for image segmentation using color clustering. A Gaussian mixture model is used to represent color distributions. Variati...
123
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...