Sciweavers

993 search results - page 3 / 199
» Set Constraints on Regular Terms
Sort
View
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 3 months ago
Shaping Level Sets with Submodular Functions
We consider a class of sparsity-inducing regularization terms based on submodular functions. While earlier work has focused on non-decreasing functions, we explore symmetric submo...
Francis Bach
IBPRIA
2003
Springer
13 years 11 months ago
Regularization of 3D Cylindrical Surfaces
In this paper we present a method for the regularization of 3D cylindrical surfaces. By a cylindrical surface we mean a 3D surface that can be expressed as an application S(l, θ) ...
Luis Álvarez, Carmelo Cuenca, Javier S&aacu...
CP
2009
Springer
14 years 7 months ago
SOGgy Constraints: Soft Open Global Constraints
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes ...
Michael J. Maher
CIKM
2008
Springer
13 years 8 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
LPAR
2005
Springer
13 years 11 months ago
Matching with Regular Constraints
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
Temur Kutsia, Mircea Marin