Sciweavers

495 search results - page 38 / 99
» Sparse representation algorithms based on mean-field approxi...
Sort
View
GBRPR
2005
Springer
15 years 3 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
93
Voted
AICOM
2006
124views more  AICOM 2006»
14 years 10 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 1 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
JMLR
2010
195views more  JMLR 2010»
14 years 8 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ICASSP
2008
IEEE
15 years 4 months ago
Subspace compressive detection for sparse signals
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
Zhongmin Wang, Gonzalo R. Arce, Brian M. Sadler