منابع مشابه
Lifting $\ell_1$-optimization strong and sectional thresholds
In this paper we revisit under-determined linear systems of equations with sparse solutions. As is well known, these systems are among core mathematical problems of a very popular compressed sensing field. The popularity of the field as well as a substantial academic interest in linear systems with sparse solutions are in a significant part due to seminal results [6, 12]. Namely, working in a s...
متن کاملLifting strong commutants of unbounded subnormal operators
Various theorems on lifting strong commutants of unbounded sub-normal (as well as formally subnormal) operators are proved. It is shown that the strong symmetric commutant of a closed symmetric operator S lifts to the strong commutant of some tight selfadjoint extension of S. Strong symmetric commutants of orthogonal sums of subnormal operators are investigated. Examples of (unbounded) irreduci...
متن کاملLifting GIS Maps into Strong Geometric Context
Contextual information can have a substantial impact on the performance of visual tasks such as semantic segmentation, object detection, and geometric estimation. Data stored in Geographic Information Systems (GIS) offers a rich source of contextual information that has been largely untapped by computer vision. We propose to leverage such information for scene understanding by combining GIS res...
متن کاملA note on lifting projections
Suppose $pi:mathcal{A}rightarrow mathcal{B}$ is a surjective unital $ast$-homomorphism between C*-algebras $mathcal{A}$ and $mathcal{B}$, and $0leq aleq1$ with $ain mathcal{A}$. We give a sufficient condition that ensures there is a proection $pin mathcal{A}$ such that $pi left( pright) =pi left( aright) $. An easy consequence is a result of [L. G. Brown and G. k. Pedersen, C*-algebras of real...
متن کاملOptimal Type Lifting Optimal Type Lifting
Modern compilers for ML-like polymorphic languages have used explicit run-time type passing to support advanced optimizations such as intensional type analysis, representation analysis and tagless garbage collection. Unfortunately, maintaining type information at run time can incur a large overhead to the time and space usage of a program. In this paper, we present an optimal type-lifting algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2005
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2004.11.019