Sciweavers

1161 search results - page 124 / 233
» Approximation schemes for clustering problems
Sort
View
IROS
2006
IEEE
202views Robotics» more  IROS 2006»
14 years 4 months ago
Topological characterization of mobile robot behavior
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
Aurélien Hazan, Frédéric Dave...
EMMCVPR
2005
Springer
14 years 3 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
CVPR
2009
IEEE
15 years 5 months ago
Stochastic Gradient Kernel Density Mode-Seeking
As a well known fixed-point iteration algorithm for kernel density mode-seeking, Mean-Shift has attracted wide attention in pattern recognition field. To date, Mean-Shift algorit...
Xiaotong Yuan, Stan Z. Li
WSCG
2004
174views more  WSCG 2004»
13 years 11 months ago
Objects and Occlusion from Motion Labeling
The problem of segmenting color video sequences is addressed. Boundary motion and occlusion relations expressed by labeling rules are argued to be of key importance for segmentati...
Albert Akhriev, Alexander Bonch-Osmolovsky, Alexan...
CISS
2008
IEEE
14 years 4 months ago
Optimization via communication networks
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
Matthew Andrews