Sciweavers

4432 search results - page 100 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
GECCO
2009
Springer
119views Optimization» more  GECCO 2009»
15 years 7 months ago
Cooperative micro-differential evolution for high-dimensional problems
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...
Konstantinos E. Parsopoulos
109
Voted
CCCG
2007
15 years 4 months ago
On a Geometric Approach to the Segment Sum Problem and Its Generalization
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
Asish Mukhopadhyay, Eugene Greene
121
Voted
ECCV
2006
Springer
15 years 6 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
CVPR
2010
IEEE
15 years 10 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
IJKESDP
2010
149views more  IJKESDP 2010»
15 years 1 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...