Sciweavers

1728 search results - page 221 / 346
» The Accelerated Euclidean Algorithm
Sort
View
TKDE
2008
195views more  TKDE 2008»
15 years 3 months ago
Learning a Maximum Margin Subspace for Image Retrieval
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
Xiaofei He, Deng Cai, Jiawei Han
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
15 years 1 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
JCO
2010
182views more  JCO 2010»
15 years 1 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
AUSAI
2010
Springer
15 years 19 days ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto
CDC
2010
IEEE
149views Control Systems» more  CDC 2010»
14 years 10 months ago
Nonuniform coverage and cartograms
In this paper, we investigate nonuniform coverage of a planar region by a network of autonomous, mobile agents. We derive centralized nonuniform coverage control laws from uniform ...
Francois Lekien, Naomi Ehrich Leonard