Sciweavers

824 search results - page 100 / 165
» Weighted Low-Rank Approximations
Sort
View
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
14 years 11 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
GLOBECOM
2007
IEEE
15 years 4 months ago
Initialization Techniques for Improved Convergence of LMS DFEs in Strong Interference Environments
— The least-mean square (LMS) decision-feedback equalizer (DFE) was previously shown [1], [2] to possess an extended convergence time in an interference limited environment. In [...
Arun Batra, James R. Zeidler, Aloysius A. Beex
VLSID
2002
IEEE
91views VLSI» more  VLSID 2002»
15 years 10 months ago
Rational ABCD Modeling of High-Speed Interconnects
This paper introduces a new numerical approximation technique, called the Differential Quadrature Method (DQM), in order to derive the rational ABCD matrix representing the high-s...
Qinwei Xu, Pinaki Mazumder
ALT
2004
Springer
15 years 6 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
ICIP
2010
IEEE
14 years 7 months ago
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
Yingsong Zhang, Nick G. Kingsbury