592 search results - page 100 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
102
click to vote
SPEECH
2010
14 years 6 months ago
2010
act 11 We analyze and compare two different methods for unsupervised extractive spontaneous speech summarization in the meeting 12 domain. Based on utterance comparison, we introdu...
126
click to vote
SAC
2006
ACM
14 years 11 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
CPAIOR
2010
Springer
15 years 3 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
100
click to vote
JNW
2006
14 years 11 months ago
2006
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...
ESOP
2007
Springer
15 years 5 months ago
2007
Springer
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a previous work, we hav...