6554 search results - page 417 / 1311 » Constraint Logic Programming |
185
click to vote
JAIR
2008
15 years 6 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
175
click to vote
JOTA
2011
15 years 1 months ago
2011
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
134
Voted
CP
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
220
click to vote
JMLR
2012
13 years 9 months ago
2012
Reducing the number of labeled examples required to learn accurate prediction models is an important problem in structured output prediction. In this paper we propose a new transd...
224
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...