Sciweavers

4767 search results - page 335 / 954
» Structures for Abstract Rewriting
Sort
View
IEEEICCI
2009
IEEE
15 years 4 months ago
Learning from an ensemble of Receptive Fields
Abstract-In this paper, we construct a neural-inspired computational model based on the representational capabilities of receptive fields. The proposed model, known as Shape Encodi...
Hanlin Goh, Joo Hwe Lim, Chai Quek
JSYML
2011
108views more  JSYML 2011»
15 years 1 months ago
Analytic equivalence relations and bi-embeddability
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complet...
Sy-David Friedman, Luca Motto Ros
TIP
2010
115views more  TIP 2010»
15 years 1 months ago
Constrained and Dimensionality-Independent Path Openings
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
Cris L. Luengo Hendriks
TSP
2010
15 years 1 months ago
Double sparsity: learning sparse dictionaries for sparse signal approximation
Abstract--An efficient and flexible dictionary structure is proposed for sparse and redundant signal representation. The proposed sparse dictionary is based on a sparsity model of ...
Ron Rubinstein, Michael Zibulevsky, Michael Elad
PLDI
2012
ACM
13 years 9 months ago
Concurrent data representation synthesis
We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a r...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...