19866 search results - page 129 / 3974 » Computing all factorizations in *** |
176
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
175
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
Many watermarking algorithms embed the watermark into the image as contiguous non-overlapping tiles. This tiling structure forms an implicit synchronization template that can be r...
197
click to vote
CSREAESA
2004
15 years 7 months ago
2004
To perform digital logic in CMOS in a truly adiabatic (asymptotically thermodynamically reversible) fashion requires that logic transitions be driven by a quasitrapezoidal (flat-t...
176
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— This paper quantifies the information rate of multiple-input multiple-output (MIMO) systems with finite rate channel state feedback and power on/off strategy. In power on/off...
157
click to vote
CORR
2011
Springer
15 years 27 days ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...