Sciweavers

6045 search results - page 153 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
EMMCVPR
2005
Springer
14 years 1 months ago
Linear Programming Matching and Appearance-Adaptive Object Tracking
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
Hao Jiang, Mark S. Drew, Ze-Nian Li
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 1 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
ICALP
2005
Springer
14 years 1 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen
IJON
2010
150views more  IJON 2010»
13 years 6 months ago
Linear discriminant analysis using rotational invariant L1 norm
Linear Discriminant Analysis (LDA) is a well-known scheme for supervised subspace learning. It has been widely used in the applications of computer vision and pattern recognition....
Xi Li, Weiming Hu, Hanzi Wang, Zhongfei Zhang
IJAR
2010
139views more  IJAR 2010»
13 years 5 months ago
Imprecise expectations for imprecise linear filtering
In the last 10 years, there has been increasing interest in interval valued data in signal processing. According to the conventional view, an interval value supposedly reflects th...
Agnès Rico, Olivier Strauss