Sciweavers

699 search results - page 72 / 140
» The method of combinatorial telescoping
Sort
View
SCALESPACE
2009
Springer
15 years 7 months ago
Convex Multi-class Image Labeling by Simplex-Constrained Total Variation
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
Jan Lellmann, Jörg H. Kappes, Jing Yuan, Flor...
CEC
2007
IEEE
15 years 7 months ago
An investigation of hyper-heuristic search spaces
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
José Antonio Vázquez Rodrígue...
94
Voted
ICRA
2007
IEEE
142views Robotics» more  ICRA 2007»
15 years 7 months ago
Hybrid Model Predictive Control for Stabilization of Wheeled Mobile Robots Subject to Wheel Slippage
— This paper studies the problem of stabilizing wheeled mobile robots (WMRs) subject to wheel slippage to a predefined set. When slippage of the wheels can occur, WMRs can be mo...
Shangming Wei, Milos Zefran, Kasemsak Uthaichana, ...
127
Voted
PAKDD
2007
ACM
158views Data Mining» more  PAKDD 2007»
15 years 6 months ago
Density-Sensitive Evolutionary Clustering
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
Maoguo Gong, Licheng Jiao, Ling Wang, Liefeng Bo
STACS
2007
Springer
15 years 6 months ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich