Sciweavers

32545 search results - page 799 / 6509
» Data Structures and Algorithms
Sort
View
CVPR
2011
IEEE
15 years 3 months ago
Sparse Image Representation with Epitomes
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictiona...
Louise Benoit, Julien Mairal, Francis Bach, Jean P...
GANDC
2011
93views more  GANDC 2011»
14 years 7 months ago
Bayesian spatial modeling and interpolation using copulas
Copulas have attracted much attention in spatial statistics over the past few years. They are used as a flexible alternative to traditional methods for nonGaussian spatial modelin...
Hannes Kazianka, Jürgen Pilz
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
16 years 1 months ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
146
Voted
CEC
2007
IEEE
16 years 2 months ago
An ant-based algorithm for annular sorting
— We present an ant-based algorithm for spatially sorting objects into an annular structure. The model is minimal, as it requires only stochastic ant behaviour coupled with a phe...
Martyn Amos, Oliver Don
ICPR
2008
IEEE
16 years 9 months ago
Manifold optimisation for motion factorisation
This paper presents a novel formulation for the popular factorisation based solution for Structure from Motion. Since our measurement matrices are populated with incomplete and in...
Appu Shaji, David Suter, Sharat Chandran