144 search results - page 12 / 29 » Solving Regular Tree Grammar Based Constraints |
233
click to vote
EMMCVPR
2011
Springer
13 years 11 months ago
2011
Springer
Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we pr...
113
Voted
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
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...
EUROGP
2007
Springer
15 years 5 months ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
110
Voted
COCOA
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
COLT
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...