Sciweavers

2252 search results - page 249 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
PODS
2003
ACM
104views Database» more  PODS 2003»
16 years 6 months ago
Maintaining time-decaying stream aggregates
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 ...
Edith Cohen, Martin Strauss
STACS
2009
Springer
16 years 1 months ago
Quantum Query Complexity of Multilinear Identity Testing
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...
Vikraman Arvind, Partha Mukhopadhyay
AVSS
2008
IEEE
16 years 1 months ago
Shadow Removal in Indoor Scenes
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 ...
Anh-Tuan Nghiem, François Brémond, M...
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
15 years 12 months ago
On-Line Windows Scheduling of Temporary Items
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...
Wun-Tat Chan, Prudence W. H. Wong
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
15 years 10 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
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...
Jason Cong, Lei He