1816 search results - page 147 / 364 » A New Approach for Solving the Maximum Clique Problem |
203
click to vote
PKDD
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Problem solving with experiences that are recorded in text form requires a mapping from text to structured cases, so that case comparison can provide informed feedback fo...
183
click to vote
CIS
2008
Springer
15 years 8 months ago
2008
Springer
Rival Penalized Competitive Learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although t...
163
click to vote
HEURISTICS
2002
15 years 6 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
161
click to vote
NAACL
2010
15 years 4 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
209
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...