Sciweavers

1712 search results - page 135 / 343
» A Computational Approach to Binding Theory
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
13 years 9 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
TVCG
2012
196views Hardware» more  TVCG 2012»
13 years 4 months ago
Robust Morse Decompositions of Piecewise Constant Vector Fields
—In this paper, we introduce a new approach to computing a Morse decomposition of a vector field on a triangulated manifold surface. The basic idea is to convert the input vector...
Andrzej Szymczak, Eugene Zhang
CONTEXT
2007
Springer
15 years 8 months ago
Similarity Measurement in Context
Context plays a crucial role when measuring the similarity of two concepts. Nonetheless, the modelling of context has been mostly neglected in existing similarity measurement theor...
Carsten Keßler
WMP
2000
15 years 5 months ago
Mathematics of Multisets
This paper is an attempt to summarize the basic elements of the multiset theory. We begin by describing multisets and the operations between them, then we present hybrid sets and t...
Apostolos Syropoulos
GG
2008
Springer
15 years 2 months ago
On the Recognizability of Arrow and Graph Languages
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
Harrie Jan Sander Bruggink, Barbara König