2252 search results - page 335 / 451 » Lower Bounds for Dynamic Algorithms |
148
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
109
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
126
click to vote
COR
2010
15 years 3 months ago
2010
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
117
click to vote
PAMI
2008
15 years 3 months ago
2008
Image denoising algorithms often assume an additive white Gaussian noise (AWGN) process that is independent of the actual RGB values. Such approaches cannot effectively remove colo...
133
click to vote
TCOM
2008
15 years 3 months ago
2008
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...