Sciweavers

3341 search results - page 579 / 669
» On Bounded Queries and Approximation
Sort
View
CORR
2011
Springer
200views Education» more  CORR 2011»
15 years 22 days ago
Optimal Channel Training in Uplink Network MIMO Systems
We consider a multi-cell frequency-selective fading uplink channel (network MIMO) from K singleantenna user terminals (UTs) to B cooperative base stations (BSs) with M antennas ea...
Jakob Hoydis, Mari Kobayashi, Mérouane Debb...
TOMS
2011
101views more  TOMS 2011»
15 years 20 days ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
VC
2011
106views more  VC 2011»
15 years 20 days ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002
JCAM
2010
116views more  JCAM 2010»
15 years 16 days ago
A vertex-based hierarchical slope limiter for p-adaptive discontinuous Galerkin methods
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
Dmitri Kuzmin
JMLR
2010
147views more  JMLR 2010»
15 years 16 days ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani