Sciweavers

344 search results - page 20 / 69
» On the Discrete Symmetric Localization Problem
Sort
View
JGO
2010
138views more  JGO 2010»
14 years 8 months ago
Continuous GRASP with a local active-set method for bound-constrained global optimization
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. ...
68
Voted
ICASSP
2009
IEEE
15 years 4 months ago
Block Jacobi-type methods for non-orthogonal joint diagonalisation
In this paper, we study the problem of non-orthogonal joint diagonalisation of a set of real symmetric matrices. A family of block Jacobitype methods are proposed to optimise two ...
Hao Shen, Knut Hüper
ROBOCUP
2005
Springer
164views Robotics» more  ROBOCUP 2005»
15 years 3 months ago
Laser-Based Localization with Sparse Landmarks
Abstract. Self-localization in dynamic environments is a central problem in mobile robotics and is well studied in the literature. One of the most popular methods is the Monte Carl...
Andreas Strack, Alexander Ferrein, Gerhard Lakemey...
PAMI
2010
260views more  PAMI 2010»
14 years 8 months ago
Unsupervised Object Segmentation with a Hybrid Graph Model (HGM)
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
Guangcan Liu, Zhouchen Lin, Yong Yu, Xiaoou Tang
75
Voted
COCOA
2008
Springer
14 years 12 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner