Sciweavers

383 search results - page 31 / 77
» A Bound on the Total Chromatic Number
Sort
View
STACS
2010
Springer
14 years 5 months ago
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
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...
Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung...
CSFW
2009
IEEE
14 years 5 months ago
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
Multi-party contract signing protocols specify how a number of signers can cooperate in achieving a fully signed contract, even in the presence of dishonest signers. This problem h...
Sjouke Mauw, Sasa Radomirovic, Mohammad Torabi Das...
TAPAS
2011
243views Algorithms» more  TAPAS 2011»
13 years 5 months ago
Speed Scaling for Energy and Performance with Instantaneous Parallelism
Abstract. We consider energy-performance tradeoff for scheduling parallel jobs on multiprocessors using dynamic speed scaling. The objective is to minimize the sum of energy consu...
Hongyang Sun, Yuxiong He, Wen-Jing Hsu
DIS
2005
Springer
14 years 3 months ago
Practical Algorithms for Pattern Based Linear Regression
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masa...
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
14 years 10 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...