Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
18
Exact Random Generation of Symmetric and Quasi-symmetric Alternating-sign Matrices
, 2008
"... We show how to adapt the Monotone Coupling from the Past exact sampling algorithm to sample from some symmetric subsets of nite distributive lattices. The method is applied to generate uniform random elements of all symmetry classes of alternating-sign matrices. 1 ..."
Abstract
- Add to MetaCart
We show how to adapt the Monotone Coupling from the Past exact sampling algorithm to sample from some symmetric subsets of nite distributive lattices. The method is applied to generate uniform random elements of all symmetry classes of alternating-sign matrices. 1
Finding Correspondence from Multiple Images via Sparse and Low-rank Decomposition
"... Abstract. We investigate the problem of finding the correspondence from multiple images, which is a challenging combinatorial problem. In this work, we propose a robust solution by exploiting the priors that the rank of the ordered patterns from a set of linearly correlated images should be lower th ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
than that of the disordered patterns, and the errors among the reordered patterns are sparse. This problem is equivalent to find a set of optimal partial permutation matrices for the disordered patterns such that the rearranged patterns can be factorized as a sum of a low rank matrix and a sparse error
Volume I: Computer Science and Software Engineering
, 2013
"... Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations in Sc ..."
Abstract
- Add to MetaCart
Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
- Add to MetaCart
mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up- ..."
Abstract
- Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up-
RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing
, 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract
- Add to MetaCart
The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED) 1 Noisy Matrix Completion under Sparse Factor Models
"... ar ..."
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
Results 1 - 10
of
18
