6045 search results - page 145 / 1209 » Computable Linearizations of Well-partial-orderings |
139
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
160
click to vote
IJCNLP
2005
Springer
15 years 9 months ago
2005
Springer
Research on linear text segmentation has been an on-going focus in NLP for the last decade, and it has great potential for a wide range of applications such as document summarizati...
129
click to vote
TIT
2010
14 years 11 months ago
2010
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
143
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
In a variety of applications, kernel machines such as Support Vector Machines (SVMs) have been used with great success often delivering stateof-the-art results. Using the kernel t...
127
click to vote
HEURISTICS
2008
15 years 4 months ago
2008
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...