Sciweavers

7519 search results - page 1100 / 1504
» Optimizing Generic Functions
Sort
View
PAMI
2007
202views more  PAMI 2007»
15 years 6 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
PR
2007
189views more  PR 2007»
15 years 6 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
ICMLC
2010
Springer
15 years 5 months ago
Multiple kernel learning and feature space denoising
We review a multiple kernel learning (MKL) technique called p regularised multiple kernel Fisher discriminant analysis (MK-FDA), and investigate the effect of feature space denois...
Fei Yan, Josef Kittler, Krystian Mikolajczyk
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
15 years 5 months ago
High quality pose estimation by aligning multiple scans to a latent map
Abstract— We introduce a method for fast and accurate registration of multiple horizontal laser scans obtained by a mobile robot. The method is based on novel representation of t...
Qi-Xing Huang, Dragomir Anguelov
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
15 years 5 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
« Prev « First page 1100 / 1504 Last » Next »