Sciweavers

405 search results - page 56 / 81
» Approximation properties of the Generalized Finite Element M...
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Sequential sparsification for change detection
This paper presents a general method for segmenting a vector valued sequence into an unknown number of subsequences where all data points from a subsequence can be represented wit...
Necmiye Ozay, Mario Sznaier, Octavia I. Camps
FAC
2010
105views more  FAC 2010»
14 years 10 months ago
A formalization of geometric constraint systems and their decomposition
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
Pascal Mathis, Simon E. B. Thierry
SIAMMAX
2010
103views more  SIAMMAX 2010»
14 years 6 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý
APAL
2010
123views more  APAL 2010»
14 years 12 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
TLCA
2009
Springer
15 years 6 months ago
Algebraic Totality, towards Completeness
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
Christine Tasson