Sciweavers

999 search results - page 65 / 200
» Constraints in Non-Boolean Contexts
Sort
View
ACL
2009
15 years 4 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad
ICANN
2009
Springer
15 years 4 months ago
MINLIP: Efficient Learning of Transformation Models
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
ICASSP
2011
IEEE
14 years 10 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
ICASSP
2011
IEEE
14 years 10 months ago
Decentralized support detection of multiple measurement vectors with joint sparsity
This paper considers the problem of finding sparse solutions from multiple measurement vectors (MMVs) with joint sparsity. The solutions share the same sparsity structure, and th...
Qing Ling, Zhi Tian
AAAI
2012
13 years 8 months ago
Reformulating Temporal Action Logics in Answer Set Programming
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
Joohyung Lee, Ravi Palla