5263 search results - page 330 / 1053 » Open Constraint Optimization |
174
click to vote
WEBI
2010
Springer
15 years 2 months ago
2010
Springer
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
131
click to vote
ICASSP
2009
IEEE
15 years 12 months ago
2009
IEEE
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
133
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
134
click to vote
IJCAI
2007
15 years 6 months ago
2007
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...
143
click to vote
PC
2002
15 years 4 months ago
2002
This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory...