Sciweavers

20 search results - page 2 / 4
» Degree Bounds for Constrained Pseudo-Triangulations
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 5 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
13 years 6 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist
ICALP
2011
Springer
12 years 10 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
FORMATS
2008
Springer
13 years 8 months ago
MTL with Bounded Variability: Decidability and Complexity
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...
Carlo A. Furia, Matteo Rossi
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints
We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and in...
Ender Tekin, Aylin Yener