6045 search results - page 145 / 1209 » Computable Linearizations of Well-partial-orderings |
CPAIOR
2007
Springer
14 years 2 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...
IJCNLP
2005
Springer
14 years 1 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...
TIT
2010
13 years 2 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),...
ICML
2010
IEEE
13 years 9 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...
HEURISTICS
2008
13 years 8 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...