Sciweavers

949 search results - page 35 / 190
» ISAC - Instance-Specific Algorithm Configuration
Sort
View
IJRR
2002
87views more  IJRR 2002»
13 years 8 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram
GLOBECOM
2010
IEEE
13 years 6 months ago
Reinforcement Learning for Link Adaptation in MIMO-OFDM Wireless Systems
Machine learning algorithms have recently attracted much interest for effective link adaptation due to their flexibility and ability to capture more environmental effects implicitl...
Sungho Yun, Constantine Caramanis
ROMAN
2007
IEEE
181views Robotics» more  ROMAN 2007»
14 years 2 months ago
Efficient Articulated Model Fitting on a Single Image or a Sequence
Abstract—Models that can efficiently, compactly, and semantically represent potential users are important tools for human-robot interaction applications. We model a person as a p...
Matheen Siddiqui, Gérard G. Medioni
CVPR
2006
IEEE
14 years 10 months ago
Affine Invariance Revisited
This paper proposes a Riemannian geometric framework to compute averages and distributions of point configurations so that different configurations up to affine transformations ar...
Evgeni Begelfor, Michael Werman
JSSPP
2004
Springer
14 years 1 months ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...