Sciweavers

1652 search results - page 175 / 331
» Power Iteration Clustering
Sort
View
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
15 years 9 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 4 months ago
Green Codes: Energy-Efficient Short-Range Communication
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
Pulkit Grover, Anant Sahai
JSAC
2006
88views more  JSAC 2006»
15 years 4 months ago
OSNR optimization in optical networks: modeling and distributed algorithms via a central cost approach
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
L. Pavel
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 4 months ago
Sum Rate Maximization using Linear Precoding and Decoding in the Multiuser MIMO Downlink
Abstract--We propose an algorithm to maximize the instantaneous sum data rate transmitted by a base station in the downlink of a multiuser multiple-input, multiple-output system. T...
Adam J. Tenenbaum, Raviraj S. Adve
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
13 years 6 months ago
Separating multilinear branching programs and formulas
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir ...