Sciweavers

895 search results - page 134 / 179
» Approximate convex decomposition
Sort
View
ICRA
2009
IEEE
101views Robotics» more  ICRA 2009»
15 years 4 months ago
Global vector field computation for feedback motion planning
— We present a global vector field computation algorithm in configuration spaces for smooth feedback motion planning. Our algorithm performs approximate cell decomposition in t...
Liangjun Zhang, Steven M. LaValle, Dinesh Manocha
VTC
2007
IEEE
104views Communications» more  VTC 2007»
15 years 4 months ago
Subspace Tracking Based Blind MIMO Transmit Preprocessing
Abstract— In this contribution projection approximation subspace tracking using deflation (PASTD) is investigated in the context of MIMO transmit preprocessing systems by exploi...
Wei Liu, Lie-Liang Yang, Lajos Hanzo
AIED
2007
Springer
15 years 3 months ago
Does Learner Control Affect Learning?
Many intelligent tutoring systems permit some degree of learner control. A natural question is whether the increased student engagement and motivation such control provides results...
Joseph E. Beck
IJCNN
2006
IEEE
15 years 3 months ago
Bi-directional Modularity to Learn Visual Servoing Tasks
— This paper shows the advantage of using neural network modularity over conventional learning schemes to approximate complex functions. Indeed, it is difficult for artificial ...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban
GD
2006
Springer
15 years 1 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele