10 citations · 20 across the 4 of their papers we have counts for
4 papers
Edit Distance to Monotonicity in Sliding Windows
Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee +3
Given a stream of items each associated with a numerical value, its edit distance to monotonicity is the minimum number of items to remove so that the remaining items are non-decre…
The Sorting Buffer Problem is NP-hard
Ho-Leung Chan, Nicole Megow, Rob van Stee +1
We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with…
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee +1
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr…
Nonclairvoyant Speed Scaling for Flow and Energy
Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam +3
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P (s) = s\^\propto. We giv…