6110 search results - page 446 / 1222 » Approximate Computing |
210
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract—We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically ...
210
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
164
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
160
Voted
VLSID
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
166
Voted
GD
2009
Springer
15 years 11 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...