Sciweavers

4524 search results - page 72 / 905
» The Complexity of Global Constraints
Sort
View
114
Voted
ICASSP
2009
IEEE
15 years 7 months ago
A global optimization framework for meeting summarization
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by...
Daniel Gillick, Korbinian Riedhammer, Benoît...
IJCAI
2003
15 years 1 months ago
Multiset Ordering Constraints
We identify a new and important global (or nonbinary) constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This const...
Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahi...
119
Voted
ATAL
2008
Springer
15 years 2 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
100
Voted
CVPR
2008
IEEE
16 years 2 months ago
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
Tomás Werner
SDM
2007
SIAM
147views Data Mining» more  SDM 2007»
15 years 2 months ago
Constraint-Based Pattern Set Mining
Local pattern mining algorithms generate sets of patterns, which are typically not directly useful and have to be further processed before actual application or interpretation. Ra...
Luc De Raedt, Albrecht Zimmermann