4930 search results - page 360 / 986 » Learning minimal abstractions |
171
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
163
click to vote
AAECC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
203
click to vote
DAGM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The paper presents an unsupervised method for partiallyblurred image restoration without influencing unblurred regions or objects. Maximum a posteriori estimation of para...
148
click to vote
FMCAD
2008
Springer
15 years 8 months ago
2008
Springer
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...
160
click to vote
ICAI
2007
15 years 8 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...