15033 search results - page 233 / 3007 » Complexity Theory and Algorithms |
173
click to vote
ASIAN
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
136
click to vote
JC
2007
15 years 4 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
126
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this contribution we show how Shannon’s coding theory could be realized for Multiple-Input Multiple-Output (MIMO) channels with the aid of EXtrinsic Information Transfer (...
154
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
117
Voted
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract—It is often claimed that future systems will necessarily be all-optical, because electronic devices are not fast enough to keep up with the increase in fiber capacity. ...