2252 search results - page 249 / 451 » Lower Bounds for Dynamic Algorithms |
112
Voted
PODS
2003
ACM
16 years 3 months ago
2003
ACM
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
144
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
114
click to vote
AVSS
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a shadow removal algorithm for indoor scenes. This algorithm uses three types of constraints: chromaticity consistency, texture consistency and range of ...
123
Voted
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit...
120
Voted
ISPD
1998
ACM
15 years 8 months ago
1998
ACM
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...