4432 search results - page 341 / 887 » Solving Demodulation as an Optimization Problem |
125
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
A recent trend in exemplar based unsupervised learning is to formulate the learning problem as a convex optimization problem. Convexity is achieved by restricting the set of possi...
134
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
131
click to vote
VISUALIZATION
1998
IEEE
15 years 8 months ago
1998
IEEE
We describe an aircraft design problem in high dimensional space, with D typically being 10 to 30. In some respects this is a classic optimization problem, where the goal is to fi...
127
click to vote
SIAMDM
2008
15 years 4 months ago
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
120
click to vote
PR
2010
15 years 3 months ago
2010
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...