817 search results - page 39 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
184
click to vote
IPMI
2011
Springer
14 years 6 months ago
2011
Springer
This paper proposes a novel method for computing linear basis images from tensor-valued image data. As a generalization of the nonnegative matrix factorization, the proposed method...
120
click to vote
SODA
1996
ACM
15 years 4 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
135
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
152
Voted
SIAMIS
2010
14 years 10 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
131
Voted
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...