7930 search results - page 307 / 1586 » Greedy in Approximation Algorithms |
163
click to vote
TWC
2008
15 years 6 months ago
2008
The study of the class of new spatial multiplexing architectures (SMAs) is continued. As introduced in Part I of this paper, the SMAs consist of joint design of rate and power all...
179
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
270
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
152
click to vote
CRYPTO
2004
Springer
16 years 1 days ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
209
click to vote
TAMC
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...