Sciweavers

2735 search results - page 206 / 547
» Comparing notions of randomness
Sort
View
ICASSP
2009
IEEE
14 years 5 months ago
Separation of a subspace-sparse signal: Algorithms and conditions
In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for...
Arvind Ganesh, Zihan Zhou, Yi Ma
CALCO
2009
Springer
141views Mathematics» more  CALCO 2009»
14 years 5 months ago
Unfolding Grammars in Adhesive Categories
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
ECSQARU
2009
Springer
14 years 5 months ago
An Algorithm for Generating Arguments in Classical Predicate Logic
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing con...
Vasiliki Efstathiou, Anthony Hunter
FSTTCS
2009
Springer
14 years 5 months ago
The Wadge Hierarchy of Max-Regular Languages
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
Jérémie Cabessa, Jacques Duparc, Ale...
CVPR
2008
IEEE
14 years 5 months ago
Modeling the structure of multivariate manifolds: Shape maps
We propose a shape population metric that reflects the interdependencies between points observed in a set of examples. It provides a notion of topology for shape and appearance m...
Georg Langs, Nikos Paragios