154 search results - page 17 / 31 » Using Proofs by Coinduction to Find |
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
FSE
2008
Springer
13 years 9 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
TPDS
1998
13 years 7 months ago
1998
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
FSE
2006
Springer
13 years 11 months ago
2006
Springer
We study a recently proposed design approach of Feistel structure which employs diffusion matrices in a switching way. At ASIACRYPT 2004, Shirai and Preneel have proved that large ...