Sciweavers

5214 search results - page 678 / 1043
» The Online Specialization Problem
Sort
View
JCT
2011
84views more  JCT 2011»
15 years 1 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff
JAR
2010
95views more  JAR 2010»
15 years 1 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
SIAMSC
2010
155views more  SIAMSC 2010»
15 years 1 months ago
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
Berkant Savas, Lek-Heng Lim
TIT
2010
129views Education» more  TIT 2010»
15 years 1 months ago
Two-way source coding with a helper
Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the reg...
Haim H. Permuter, Yossef Steinberg, Tsachy Weissma...
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 1 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...