Sciweavers

664 search results - page 70 / 133
» Some results for a class of generalized polynomials
Sort
View
SIROCCO
2008
14 years 11 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Andreas Emil Feldmann, Heiko Röglin, Berthold...
ICASSP
2010
IEEE
14 years 10 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
JSAC
2008
105views more  JSAC 2008»
14 years 9 months ago
Vector Precoding for Wireless MIMO Systems and its Replica Analysis
This paper studies a nonlinear vector precoding scheme which inverts the wireless multiple-input multiple-output (MIMO) channel at the transmitter so that simple symbol-bysymbol de...
Ralf R. Müller, Dongning Guo, Aris L. Moustak...
TSP
2008
117views more  TSP 2008»
14 years 9 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani