Sciweavers

5169 search results - page 28 / 1034
» Locality approximation using time
Sort
View
CAD
2004
Springer
13 years 7 months ago
Control point adjustment for B-spline curve approximation
Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage o...
Huaiping Yang, Wenping Wang, Jia-Guang Sun
SAC
1996
ACM
13 years 11 months ago
A genetic algorithm for the minimum broadcast time problem using a global precedence vector
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wa...
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
ICCV
2007
IEEE
13 years 9 months ago
Ten-fold Improvement in Visual Odometry Using Landmark Matching
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
Zhiwei Zhu, Taragay Oskiper, Supun Samarasekera, R...
AAIM
2007
Springer
141views Algorithms» more  AAIM 2007»
14 years 1 months ago
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi